Skip to main content

Replica Selection on Co-allocation Data Grids

  • Conference paper
Parallel and Distributed Processing and Applications (ISPA 2004)

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

Abstract

Data Grid supports data-intensive applications in a large scale grid environment. It makes use of storage systems as distributed data stores by replicating contents. On the co-allocation architecture, the client can divide a file into k blocks of equal size and download the blocks dynamically from multiple servers by GridFTP in parallel. But the drawback is that faster servers must wait for the slowest server to deliver the final block. Therefore, designing efficient strategies for accessing a file from multiple copies is very import. In this paper, we propose two replica retrieval approaches, abort-and-retransfer and one by one co-allocation, to improve the performance of the data grids. Our schemes decrease the completion time of data transfer and reduce the workload of slower serves. Experiment results are also done to demonstrate its performances.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. The Globus Project, http://www.globus.org/

  2. MPICH-G2, http://www.hpclab.niu.edu/mpi/

  3. LHC - The Large Hadron Collider Home Page, http://lhc-new-homepage.web.cern.ch/

  4. Enabling Applications for Grid Computing with Globus, ibm.com/redbooks (2002)

    Google Scholar 

  5. Foster, I., Kesselman, C., Tuecke, S., International, J.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. Supercomputer Applications 15(3) (2001)

    Google Scholar 

  6. Aloisio, G., Cafaro, M., Blasi, E., Epicoco, I.: The Grid Resource Broker, a Ubiquitous Grid Computing Framework. To appear in Journal of Scientific Programming, Special Issue on Grid Computing, IOS Press, Amsterdam, http://sara.unile.it/grb/grb.html

  7. Storage Resource Broker, Version 2.0, SDSC, http://www.npaci.edu/dice/srb

  8. Moore, R., Rajasekar, A.: Data and Metadata Collections for Scientific Applications. In: High Performance Computing and Networking, Amsterdam, NL (June 2001)

    Google Scholar 

  9. Czajkowski, K., Foster, l., Karonis, N., Kesselman, C., Martin, S., Smith, W., Tueche, S.: A Resource Management Architecture for Metacomputing Systems. In: IPPS/SPDP 1998 Workshop on Job Scheduling Strategies for Parallel Processing (1998)

    Google Scholar 

  10. Allcock, B., Bester, J., Bresnahan, J., Chervenak, A.L., foster, I., Kesselman, C., Meder, S., Nefedova, V., Quesnel, D., Tuecke, S.: Data Management and Transfer in High-performance Computational Grid Environments. Parallel Computing Journal 28(5), 749–771 (2002)

    Article  Google Scholar 

  11. 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 Datasets. Journal of Network and Computer Applications 23, 187–200 (2001); based on conference publication from Proceedings of NetStore Conference 1999

    Google Scholar 

  12. Stockinger, H., Samar, A., Allcock, B., Foster, I., Holtman, K., Tierney, B.: File and Object Replication in Data Grids. Journal of Cluster Computing 5(3), 305–314 (2002)

    Article  Google Scholar 

  13. Vazhkudai, S., Tuecke, S., Foster, I.: Replica Selection in the Globus Data Grid. IEEE/ACM International Symposium on Cluster Computing and the Grid, 106–113 (May 2001)

    Google Scholar 

  14. Vazhkudai, S., Schopf, J.M.: Predicting Sporadic Grid Data Transfers. In: IEEE International Symposium on High Performance Distributed Computing, HPDC-11 2002, July 2002, pp. 188–196 (2002)

    Google Scholar 

  15. Vazhkudai, S., Schopf, J.M., Foster, I.: Predicting the Performance of Wide Area Data Transfers. In: International Parallel and Distributed Processing Symposium, IPDPS 2002, April 2002, pp. 34–43 (2002)

    Google Scholar 

  16. Vazhkudai, S.: Enabling the Co-Allocation of Grid Data Transfers. In: International Workshop on Grid Computing, vol. 17, pp. 44–51 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, RS., Wang, CM., Chen, PH. (2004). Replica Selection on Co-allocation Data Grids. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2004. Lecture Notes in Computer Science, vol 3358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30566-8_70

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30566-8_70

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24128-7

  • Online ISBN: 978-3-540-30566-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics