Disk Cache Replacement Algorithm for Storage Resource Managers in Data Grids
- 1 January 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10639535,p. 12
- https://doi.org/10.1109/sc.2002.10043
Abstract
We address the problem of cache replacement policies for Storage Resource Managers (SRMs) that are used in Data Grids. An SRM has a disk storage of bounded capacity that retains some N objects. A replacement policy is applied to determine which object in the cache needs to be evicted when space is needed. We define a utility function for ranking the candidate objects for eviction and then describe an efficient algorithm for computing the replacement policy based on this function. This computation takes time O (log N). We compare our policy with traditional replacement policies such as Least Frequently Used (LFU), Least Recently Used (LRU), LRU-K, Greedy Dual Size (GDS), etc., using simulations of both synthetic and real workloads of file accesses to tertiary storage. Our simulations of replacement policies account for delays in cache space reservation, data transfer and processing. The results obtained show that our proposed method is the most cost effective cache replacement policy for Storage Resource Managers (SRM).Keywords
This publication has 7 references indexed in Scilit:
- Improved adaptive replacement algorithm for disk caches in HSM systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The data grid: Towards an architecture for the distributed management and analysis of large scientific datasetsJournal of Network and Computer Applications, 2000
- On disk caching of Web objects in proxy serversPublished by Association for Computing Machinery (ACM) ,1997
- The LRU-K page replacement algorithm for database disk bufferingPublished by Association for Computing Machinery (ACM) ,1993
- HOPTPublished by Association for Computing Machinery (ACM) ,1983
- Analysis of Long Term File Reference Patterns for Application to File Migration AlgorithmsIEEE Transactions on Software Engineering, 1981
- Principles of Optimal Page ReplacementJournal of the ACM, 1971