loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fourth International Workshop on Grid Computing
Enabling the Co-Allocation of Grid Data Transfers
Phoenix, Arizona
November 17-November 17
ISBN: 0-7695-2026-X
Sudharshan Vazhkudai, The University of Mississippi
Data-sharing scientific communities use storage systems as distributed data stores by replicating content. In such highly replicated environments, a particular dataset can reside at multiple locations and can thus be downloaded from any one of them. Since datasets of interest are significantly large in size, improving download speeds either by server selection or by co-allocation can offer substantial benefits.
In this paper, we present an architecture for co-allocating Grid data transfers across multiple connections, enabling the parallel download of datasets from multiple servers. We have developed several co-allocation strategies comprising of simple brute-force, history-based and dynamic load balancing techniques as a means both to exploit rate differences among the various client-server links and to address dynamic rate fluctuations. We evaluate our approaches using the GridFTP data movement protocol in a wide-area testbed and present our results.
Index Terms:
Data Grids, Co-allocation, Partial Transfers, Scheduling, Peer-to-peer
Citation:
Sudharshan Vazhkudai, "Enabling the Co-Allocation of Grid Data Transfers," grid, pp.44, Fourth International Workshop on Grid Computing, 2003
Usage of this product signifies your acceptance of the Terms of Use.