Abstract
We propose a model, which simultaneously allocates a data block request to the multiple sites, termed as co-allocation, to enable parallel data transfer in a grid environment. The model comprises of co-allocator, monitor and control mechanisms. The co-allocation scheme adapts well to the highly inconsistent network performances of the sites concerned. The scheme initially obtains the bandwidth parameter from the monitor module to fix the partition size and the data transfer tasks are allocated onto the servers in duplication. The scheme is found to be tolerant despite the situation that the link to servers under consideration is broken or become idle. We used Globus toolkit for our framework and utilized the partial copy feature of GridFTP. We compared our schemes with the existing schemes and the results show notable improvement in overall completion time of data transfer.
Chapter PDF
Similar content being viewed by others
References
Allcock, B., Bester, J., et al.: Data Management and Transfer in High Performance Computational Grid Environments. Parallel Computing (May 2002)
Bhuvaneswaran, R.S., Katayama, Y., Takahashi, N.: Dynamic Co-allocation Scheme for Parallel Data Transfer in Grid Environment. In: Semantics, Knowledge and Grid, Beijing, pp. 178–188 (2005)
Yang, C.-T., Yang, I.H., Chen, C.H.: Improve Dynamic Adjustment Mechanism in Co-allocation data Grid Environments. In: Proceedings of the 11th Workshop on Compiler Techniques for High-Performance Computing (CTHPC 2005), pp. 189–194 (2005)
Chervenak, A., et al.: A Framework for Constructing Scalable Replica Location Services. In: Proceedings of Super Computing Conference 2002, Baltimore (2002)
Chervenak, A., Foster, I., et al.: 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)
Chen, C.H., Yang, C.-T., Lai, C.-L.: Towards an Efficient Replica selection for Data Grid. In: Workshop on Grid Technologies and Applications (December 2004)
Czakowski, K., Foster, I., Kesselman, C.: Resource Co-allocation in Computational Grids. In: Proc. IEEE International Symposium on High Performance Distributed Computing (1999)
Data Grid Project (EU Data Grid), http://www.eu-datagrid.org
GridPhyN project (Grid Physics Network), http://www.griphyn.org
Hui, S.C., Lee, J.Y.B.: Modeling of Aggregate Available Bandwidth in Many-to- One Data Transfer. In: Proc. of the Fourth International Conference on Intelligent Multimedia Computing and Networking, Utah, July 21-26 (2005)
Introduction to Grids and the Globus Toolkit, The Globus Project, http://www.globus.org
Iperf Homepage: http://dast.nlanr.net/Projects/Iperf/
Fujimoto, N., Hagihara, K.: Near Optimal Dynamic Task Scheduling of Independent Coarse Grained Tasks onto a Computational Grid. In: International Conference on Parallel Processing (ICPP 2003), October 6-9, pp. 391–398 (2003)
Vazhkudai, S.: Enabling the Co-allocation of Grid Data Transfers. In: International Workshop on Grid Computing, November 2003, pp. 44–51 (2003)
Vazhkudai, S., Tuecke, S., Foster, I.: Replica Selection in the Globus Data Grid. In: IEEE/ACM International Symposium on Cluster Computing and the Grid, May 2001, pp. 106–113 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhuvaneswaran, R.S., Katayama, Y., Takahashi, N. (2006). Coordinated Co-allocator Model for Data Grid in Multi-sender Environment. In: Dan, A., Lamersdorf, W. (eds) Service-Oriented Computing – ICSOC 2006. ICSOC 2006. Lecture Notes in Computer Science, vol 4294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11948148_6
Download citation
DOI: https://doi.org/10.1007/11948148_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68147-2
Online ISBN: 978-3-540-68148-9
eBook Packages: Computer ScienceComputer Science (R0)