Storage resource reservation method for data grid

To solve the problems of low acceptance rate, too much resource capacity debris, serious waste of storage space caused by directly applying binary resource capacity reservation strategy to storage resource capacity reservation (SRCR) in data grid, by analyzing the characteristics of SRCR for data grid application, a four-tuple reservation strategy (FTRS) is proposed. The traditional time slot algorithm for binary strategy can not be applied to FTRS, so the basic trapezoidal algorithm and threshold trapezoidal algorithm (TTA) are put forward. The experimental results show that, compared with binary strategy, FTRS achieves higher resource utilization and acceptance rate, meanwhile, TTA can adapt to network speed jitter.