Improvements on dynamic adjustment mechanism in co-allocation data grid environments

  • Authors:

  • Chao-Tung Yang;I-Hsien Yang;Kuan-Ching Li;Shih-Yu Wang

  • Affiliations:

  • High-Performance Computing Laboratory, Department of Computer Science and Information Engineering, Tunghai University, Taichung City, Taiwan R.O.C. 40704;High-Performance Computing Laboratory, Department of Computer Science and Information Engineering, Tunghai University, Taichung City, Taiwan R.O.C. 40704;Department of Computer Science and Information Engineering, Providence University, Taichung, Taiwan R.O.C. 43301;High-Performance Computing Laboratory, Department of Computer Science and Information Engineering, Tunghai University, Taichung City, Taiwan R.O.C. 40704

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 finishing 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.