Heuristic-based scheduling to maximize throughput of data-intensive grid applications

  • Authors:
  • Souvik Ray;Zhao Zhang

  • Affiliations:
  • Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa;Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa

  • Venue:
  • IWDC'04 Proceedings of the 6th international conference on Distributed Computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Job scheduling in data grids must consider not only computation loads at each grid node but also the distributions of data required by each job. Furthermore, recent trends in grid applications emphasize high throughput more than high performance. In this paper, we propose a centralized scheduling scheme, which uses a scheduling heuristic called Maximum Residual Resource (MRR) that targets high throughput for data grid applications. We have analyzed the performance potentials of MRR, and have developed a simulator to evaluate it with typical grid configurations. Our results show that MRR brings significant performance improvements over existing online and batch heuristics like MCT, Min–min and Max-min.