Sized-Based Replacement-k Replacement Policy in Data Grid Environments

  • HongJin Park
  • ChangHoon Lee
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4330)


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.


Data Grid File Size Cache Size Replacement Policy Virtual Memory 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Allcock, B., Foster, I., Nefedova, V., Chervenak, A., Deelman, D., et al.: High-performance remote access to climate simulation data: A challenge problem for data grid technologies. In: Proceeding of the SuperComputing Conference, Non. (2003)Google Scholar
  2. 2.
    IIoltman, K.: Data grid system overview and requirements, Technical report, CERN (July 2001)Google Scholar
  3. 3.
    Russel, M., Allen, G., Daues, G., Foster, I., Seidel, E., Novotny, J., Shalf, J., von Laszewski, G.: The astophysics simulation collaboratory: A science portal enabling community software deveopment. In: Cluster Computing (2002)Google Scholar
  4. 4.
    Chervenak, A., Foster, I., Kesselman, C., Salisbury, C., Tueckes, S.: The data grid: Towards an architecture for the distributed management and analysis of large scientific data-sets. Journal of Network and Computer Applications, 187–200 (2002)Google Scholar
  5. 5.
    Otoo, E.J., Olken, F., Shoshani, A.: Disk Cache replacement algorithm for storage resource managers in data grids. In: The 15th Annual Super Computer Conference, November 2002, pp. 1–15 (2002)Google Scholar
  6. 6.
    Abawajy, J.H.: File Replacement Algorithm for Storage Resource Managers in Data Grids. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol. 3038, pp. 339–346. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Carman, M., Serafini, F., Stokinger, L., Stockinger, K.: Towards an Economy-Based Optimisation of File Access and Replication on a Data Grid. In: Procedings of 2nd CCGRID, pp. 120–126 (2002)Google Scholar
  8. 8.
    Jiang, S., Zhang, X.: An Efficient Distributed Disk Caching in Data Grid Managemnet. In: Proceedings of Cluster Computing (2003)Google Scholar
  9. 9.
    Aberham, S., Peter Baer, G., Greg, G.: Operating system principles, 7th edn. Wiley, Chichester (2006)Google Scholar
  10. 10.
    Otoo, E.J., O’Neil, F., Weilum, G.: The LRU-K page repalcement Algorithm for Database Disk Buffering. In: The 15th Annual Super Computer Conference (November 2002)Google Scholar
  11. 11.
    Gameron, D.G., Carvajal-Schiaffino, R., Ferguson, J.: OptorSim v2.0 Installation and User Guid,
  12. 12.
    Bell, W.H., Gameron, D.G.: Optorsim - data grid simulator for studying dynamic data replication strategies. Journal of High Performance Computing Application (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • HongJin Park
    • 1
  • ChangHoon Lee
    • 2
  1. 1.School of Computer Information and Communication EngineeringSangji UniversityKangwon-doKorea
  2. 2.Department of Computer EngineeringHankyong National UniversityKyunggi-doKorea

Personalised recommendations