Redundant parallel file transfer with anticipative recursively-adjusting scheme in data grids

  • Authors:

  • Chao-Tung Yang;Yao-Chun Chi;Tsu-Fen Han;Ching-Hsien Hsu

  • Affiliations:

  • High-Performance Computing Laboratory, Department of Computer Science and Information Engineering, Tunghai University, Taichung, Taiwan R.O.C;High-Performance Computing Laboratory, Department of Computer Science and Information Engineering, Tunghai University, Taichung, Taiwan R.O.C;High-Performance Computing Laboratory, Department of Computer Science and Information Engineering, Tunghai University, Taichung, Taiwan R.O.C;Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan

  • Venue:
  • ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The co-allocation architecture was developed to enable the parallel download of datasets/servers from selected replica servers, and the bandwidth performance is the main factor that affects the internet transfer between the client and the server. Therefore, it is important to reduce the difference of finished time among replica servers, and manage changeful network performance during the term of transferring as well. In this paper, we proposed an Anticipative Recursively-Adjusting Co-Allocation scheme, to adjust the workload of each selected replica server, which handles unwarned variant network performances of the selected replica servers. The algorithm is based on the previous finished rate of assigned transfer size, to anticipate that bandwidth status on next section for adjusting the workload, and further, to reduce file transfer time in a grid environment. Our approach is usefully in unstable gird environment, which reduces the wasted idle time for waiting the slowest server and decreases file transfer completion time.