Skip to main content
SpringerLink
Log in

Identifying Dynamic Replication Strategies for a High-Performance Data Grid

  • Conference paper
  • First Online:
Grid Computing — GRID 2001 (GRID 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2242))

Included in the following conference series:

Abstract

Dynamic replication can be used to reduce bandwidth consumption and access latency in high performance “data grids” where users require remote access to large files. Different replication strategies can be defined depending on when, where, and how replicas are created and destroyed. We describe a simulation framework that we have developed to enable comparative studies of alternative dynamic replication strategies. We present preliminary results obtained with this simulator, in which we evaluate the performance of five different replication strategies for three different kinds of access patterns. The data in this scenario is read-only and so there are no consistency issues involved. The simulation results show that significant savings in latency and bandwidth can be obtained if the access patterns contain a small degree of geographical locality.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Acharya, S., Zdonik, S.B.: An efficient scheme for dynamic data replication: Technical report CS-93-94-43, Brown University

    Google Scholar 

  2. Baentsc, M., et al.: Quantifying the overall impact of caching and replication in the web. University of Kaiserslautern February (1997)

    Google Scholar 

  3. Bestavros, A., Cunha, C: Server-initiated document dissemination for the WWW. IEEE Data Engineering Bulletin, Vol. 19 (1996) 3–11

    Google Scholar 

  4. Bestavros, A.: Demand-based document dissemination to reduce traffic and balance load in distributed information systems. IEEE symposium on Parallel and Distributed Processing, San Antonio, TX (1995)

    Google Scholar 

  5. Bhatacharjee, S., Calvert, K.L., Zegura, E.: Self-organizing wide-area network caches. Georgia Institute of Technology GIT-CC-97/31(1997)

    Google Scholar 

  6. Chervenak, A., Foster, I., Kesselman, C, Salisbury, C, Tuecke, S.: The Data Grid: Towards an Architecture for the Distributed Management and Analysis of Large Scientific Data Sets. J. Network and Computer Applications (2000)

    Google Scholar 

  7. Chuang, J.C.I., Sirbu, M.A.: Distributed Network Storage with Quality-of-Service Guarantees. Proc. INET99 (1999)

    Google Scholar 

  8. Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. ACM SIGCOMM (1998)

    Google Scholar 

  9. Foster, I., Kesselman, C. (eds.): The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann (1999)

    Google Scholar 

  10. Foster, I., Kesselman, C, Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. Intl. J. Supercomputer Applications, (to appear).

    Google Scholar 

  11. GriPhyN: The Grid Physics Network Project http://www.griphvn.oro

  12. Gwertzman, J., Seltzer, M.: The case for geographical push-caching. 5th Annual Workshop on Hot Operating Systems (1995)

    Google Scholar 

  13. Holtman, K.: HEPGRID2001: A Benchmark for Virtual Data Grid Schedulers. http://kholtman.home.cern.ch/kholtman/tmp/benchv3.ps

  14. Michel, S., Nguyen, K., Rosenstein, A., Zhang, L., Floyd, L., Jacobson, V.: Adaptive Web Caching: Towards a New Global Caching Architecture. Proceedings of the 3rd International WWW Caching Workshop (1998)

    Google Scholar 

  15. Rabinovich, M., Aggarwal, A.: RaDaR: A scalable architecture for a global Web hosting service. The 8th Int. World Wide Web Conf, May (1999)

    Google Scholar 

  16. Samar, A., Stockinger, H.: Grid Data Management Pilot (GDMP): A Tool for Wide Area Replication. IASTED International Conference on Applied Informatics, Innsbruck, Austria (2001)

    Google Scholar 

  17. Wolfson, O., Jajodia, S., Huang, Y.: An Adaptive Data Replication algorithm. ACM transactions on Database Systems (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Chicago, 1100 E 58lh Street, 60637, Chicago, IL, USA

    Kavitha Ranganathan & Ian Foster

Authors
  1. Kavitha Ranganathan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ian Foster
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. High Performance Computing, The Aerospace Corp., 2350 East El Segundo Blvd., 90245, El Segundo, CA, USA

    Craig A. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ranganathan, K., Foster, I. (2001). Identifying Dynamic Replication Strategies for a High-Performance Data Grid. In: Lee, C.A. (eds) Grid Computing — GRID 2001. GRID 2001. Lecture Notes in Computer Science, vol 2242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45644-9_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45644-9_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42949-4

  • Online ISBN: 978-3-540-45644-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation