Skip to main content
Log in

Improvements on dynamic adjustment mechanism in co-allocation data grid environments

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Several co-allocation strategies have been coupled and used to exploit rate differences among various client-server links and to address dynamic rate fluctuations by dividing files into multiple blocks of equal sizes. However, a major obstacle, the idle time of faster servers having to wait for the slowest server to deliver the final block, makes it important to reduce differences in finishing time among replica servers. In this paper, we propose a dynamic co-allocation scheme, namely Recursive-Adjustment Co-Allocation scheme, to improve the performance of data transfer in Data Grids. Our approach reduces the idle time spent waiting for the slowest server and decreases data transfer completion time.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Allcock B, Bester J, Bresnahan J, Chervenak A, Foster I, Kesselman C, Meder S, Nefedova V, Quesnel D, Tuecke V (2002) Data management and transfer in high-performance computational grid environments. Parallel Comput 28(5):749–771

    Article  Google Scholar 

  2. Allcock B, Bester J, Bresnahan J, Chervenak A, Foster I, Kesselman C, Meder S, Nefedova V, Quesnel D, Tuecke S (2001) Secure, efficient data transport and replica management for high-performance data-intensive computing. In: Proc of the eighteenth IEEE symposium on mass storage systems and technologies, 2001, pp 13–28

  3. Chervenak A, Deelman E, Foster I, Guy L, Hoschek W, Iamnitchi A, Kesselman C, Kunszt P, Ripeanu M (2002) Giggle: a framework for constructing scalable replica location services. In: Proc of SC 2002, Baltimore, MD, 2002

  4. Chervenak A, Foster I, Kesselman C, Salisbury C, Tuecke S (2001) The data grid: towards an architecture for the distributed management and analysis of large scientific datasets. J Netw Comput Appl 23:187–200

    Article  Google Scholar 

  5. Czajkowski K, Fitzgerald S, Foster I, Kesselman C (2001) Grid information services for distributed resource sharing. In: Proceedings of the tenth IEEE international symposium on high-performance distributed computing (HPDC-10’01), August 2001, pp 181–194

  6. Czajkowski K, Foster I, Kesselman C (1999) Resource co-allocation in computational grids. In: Proceedings of the eighth IEEE international symposium on high performance distributed computing (HPDC-8’99), August 1999

  7. Donno F, Gaido L, Ghiselli A, Prelz F, Sgaravatto M (2002) DataGrid prototype 1. In: TERENA Networking Conference, June 2002. http://www.terena.nl/conferences/tnc2002/Papers/p5a2-ghiselli.pdf

  8. Global Grid Forum. http://www.ggf.org/

  9. Hoschek W, Jaen-Martinez J, Samar A, Stockinger H, Stockinger K (2000) Data management in an international data grid project. In: First IEEE/ACM international workshop on grid computing—grid 2000, Bangalore, India, December 2000

  10. IBM Red Books, Introduction to Grid Computing with Globus. IBM Press, www.redbooks.ibm.com/redbooks/pdfs/sg246895.pdf

  11. Stockinger H, Samar A, Allcock B, Foster I, Holtman K, Tierney B (2002) File and object replication in data grids. J Clust Comput 5(3):305–314

    Article  Google Scholar 

  12. The Globus Alliance. http://www.globus.org/

  13. Vazhkudai S (2003) Enabling the co-allocation of grid data transfers. In: Proceedings of fourth international workshop on grid computing, November 2003, pp 41–51

  14. Vazhkudai S, Schopf J (2003) Using regression techniques to predict large data transfers. Int J High Perform Comput Appl (IJHPCA) 17:249–268

    Article  Google Scholar 

  15. Vazhkudai S, Tuecke S, Foster I (2001) Replica selection in the globus data grid. In: Proceedings of the 1st international symposium on cluster computing and the grid (CCGRID 2001), May 2001, pp 106–113

  16. Vazhkudai S, Schopf J (2002) Predicting sporadic grid data transfers. In: Proceedings of 11th IEEE international symposium on high performance distributed computing (HPDC-11 ’02) July 2002, pp 188–196

  17. Vazhkudai S, Schopf J, Foster I (2002) Predicting the performance of wide area data transfers. In: Proceedings of the 16th international parallel and distributed processing symposium (IPDPS 2002), April 2002, pp 34–43

  18. Wolski R, Spring N, Hayes J (1999) The network weather service: a distributed resource performance forecasting service for metacomputing. Future Gener Comput Syst 15(5-6):757–768

    Article  Google Scholar 

  19. Yang C-T, Chen C-H, Li K-C, Hsu C-H (2005) Performance analysis of applying replica selection technology for data grid environments. In: PaCT 2005, lecture notes in computer science, vol 3603, Springer, September 2005, pp 278–287

  20. Zhang X, Freschl J, Schopf J (2003) A performance study of monitoring and information services for distributed systems. In: Proceedings of 12th IEEE international symposium on high performance distributed computing (HPDC-12 ’03), August 2003, pp 270–282

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chao-Tung Yang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, CT., Yang, IH., Li, KC. et al. Improvements on dynamic adjustment mechanism in co-allocation data grid environments. J Supercomput 40, 269–280 (2007). https://doi.org/10.1007/s11227-006-0022-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-006-0022-3

Keywords

Navigation