The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Principles of Optimal Page Replacement
Journal of the ACM (JACM)
Evaluating content management techniques for Web proxy caches
ACM SIGMETRICS Performance Evaluation Review
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Data Management in an International Data Grid Project
GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
WATCHMAN: A Data Warehouse Intelligent Cache Manager
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Disk cache replacement algorithm for storage resource managers in data grids
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
HOPT: A myopic version of the STOCHOPT automatic file migration policy
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
MySRB & SRB: Components of a Data Grid
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
Optimal File-Bundle Caching Algorithms for Data-Grids
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
An on-line replication strategy to increase availability in Data Grids
Future Generation Computer Systems
An optimization of resource replication access in grid cache
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
International Journal of High Performance Computing Applications
Parallel and multi-wavelength downloading in optical grid networks
Photonic Network Communications
Hi-index | 0.00 |
Caching techniques have been used to improve the performance gap of storage hierarchies in computing systems. In data intensive applications that access large data files over wide area network environment, such as a data grid, caching mechanism can significantly improve the data access performance under appropriate workloads. In a data grid, it is envisioned that local disk storage resources retain or cache the data files being used by local application. Under a workload of shared access and high locality of reference, the performance of the caching techniques depends heavily on the replacement policies being used. A replacement policy effectively determines which set of objects must be evicted when space is needed. Unlike cache replacement policies in virtual memory paging or database buffering, developing an optimal replacement policy for data grids is complicated by the fact that the file objects being cached have varying sizes and varying transfer and processing costs that vary with time. We present an accurate model for evaluating various replacement policies and propose a new replacement algorithm referred to as Least Cost Beneficial based on K backward references (LCB-K). Using this modeling technique, we compare LCB-K with various replacement policies such as Least Frequently Used (LFU), Least Recently Used (LRU), Greedy Dual Size (GDS), etc., using synthetic and actual workload of accesses to and from tertiary storage systems. The results obtained show that (LCB-K) and (GDS) are the most cost effective cache replacement policies for storage resource management in data grids.