A recursive-adjustment co-allocation scheme in data grid environments

  • Authors:
  • Chao-Tung Yang;I-Hsien Yang;Kuan-Ching Li;Ching-Hsien Hsu

  • Affiliations:
  • High Performance Computing Laboratory, Department of Computer Science and Information Engineering, Tunghai University, Taichung, Taiwan, ROC;High Performance Computing Laboratory, Department of Computer Science and Information Engineering, Tunghai University, Taichung, Taiwan, ROC;Parallel and Distributed Processing Center, Department of Computer Science and Information Management, Providence University, Taichung, Taiwan, ROC;Department of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan

  • Venue:
  • ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The co-allocation architecture was developed in order to enable parallel downloads of datasets from multiple servers. 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 finish 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.