Sized-Based replacement-k replacement policy in data grid environments

Authors:
HongJin Park;ChangHoon Lee
Affiliations:
School of Computer Information and Communication Engineering, Sangji University, Kangwon-do, Korea;Department of Computer Engineering, Hankyong National University, Kyunggi-do, Korea
Venue:
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Year:
2006

Citing 5
Cited 0

The LRU-K page replacement algorithm for database disk buffering

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
High-performance remote access to climate simulation data: a challenge problem for data grid technologies

Proceedings of the 2001 ACM/IEEE conference on Supercomputing
The Astrophysics Simulation Collaboratory: A Science Portal Enabling Community Software Development

Cluster Computing
Disk cache replacement algorithm for storage resource managers in data grids

Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Towards an Economy-Based Optimisation of File Access and Replication on a Data Grid

CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid

Quantified Score

Hi-index	0.00

Visualization

Abstract

The data grid computing provides geographically distributed storage resources to solve computational problems with large-scale data. Unlike cache replacement policies in virtual memory or web-caching replacement, an optimal file replacement policy for data grids is the one of the important problems by the fact that file size is very large. The traditional file replacement policies such as LRU(Least Recently Used), LCB-K(Least Cost Beneficial based on K), EBR(Economic-based cache replacement), LVCT(Least Value-based on Caching Time) must predict near future or need additional resources for file replacement. In this paper, the SBR-k(Sized-based replacement-k) policy for solving previous problems propose. The SBR-k replacement is a file size based replacement policy for new file. The results of the simulation show that the proposed policy performs better than traditional policies.