The impact of data replication on job scheduling performance in the Data Grid

  • Authors:
  • Ming Tang;Bu-Sung Lee;Xueyan Tang;Chai-Kiat Yeo

  • Affiliations:
  • School of Computer Engineering, Nanyang Technological University, Blk N4, #2a-32, Nanyang Avenue, Singapore 639798, Singapore;School of Computer Engineering, Nanyang Technological University, Blk N4, #2a-32, Nanyang Avenue, Singapore 639798, Singapore;School of Computer Engineering, Nanyang Technological University, Blk N4, #2a-32, Nanyang Avenue, Singapore 639798, Singapore;School of Computer Engineering, Nanyang Technological University, Blk N4, #2a-32, Nanyang Avenue, Singapore 639798, Singapore

  • Venue:
  • Future Generation Computer Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the Data Grid environment, the primary goal of data replication is to shorten the data access time experienced by the job and consequently reduce the job turnaround time. After introducing a Data Grid architecture that supports efficient data access for the Grid job, the dynamic data replication algorithms are put forward. Combined with different Grid scheduling heuristics, the performances of the data replication algorithms are evaluated with various simulations. The simulation results demonstrate that the dynamic replication algorithms can reduce the job turnaround time remarkably. In particular, the combination of shortest turnaround time scheduling heuristic (STT) and centralized dynamic replication with response-time oriented replica placement (CDR_RTPlace) exhibits remarkable performance in diverse system environments and job workloads.