An Anticipative Recursively Adjusting Mechanism for parallel file transfer in Data Grids

作者：Yang Chao Tung^*; Yang Ming Feng; Chi Yao Chun; Hsu Ching Hsien

来源：Concurrency and Computation-Practice & Experience, 2010, 22(15): 2144-2169.

DOI：10.1002/cpe.1565

• Data Grid
• recursively adjusting
• co-allocation
• dynamic
• parallel file transfer

Data Grids enable the sharing, selection, and connection of a wide variety of geographically distributed computational and storage resources for content needed by large-scale data-intensive applications such as high-energy physics, bioinformatics, and virtual astrophysical observatories. In Data Grids, co-allocation architectures were developed to enable parallel downloads of data sets from selected replica servers. As Internet is usually the underlying network of a grid, network bandwidth plays as the main factor affecting file transfers between clients and servers. In this paradigm, there are still some challenges that need to be solved, such as to reduce differences in finish times between selected replica servers, to avoid traffic congestion resulting from transferring the same blocks in different links among servers and clients, and to manage network performance variations among parallel transfers. In this paper, we propose the Anticipative Recursively Adjusting Mechanism (ARAM) scheme to adjust the workloads on selected replica servers and handle unpredictable variations in network performance by those servers. Our algorithm is based on using the finish rates for previously assigned transfers to anticipate the bandwidth status for the next section to adjust workloads, and to reduce file transfer times in grid environments. Our approach is useful in grid environments with unstable network link. It not only reduces idle time wasted waiting for the slowest server, but also decreases file transfer completion times.

• 出版日期2010-10