Analysis and evaluation of grid scheduling algorithms using real workload traces

  • Authors:
  • Syed Nasir Mehmood Shah;Ahmad Kamil Bin Mahmood;Alan Oxley

  • Affiliations:
  • Universiti Teknologi PETRONAS, Perak, Malaysia;Universiti Teknologi PETRONAS, Perak, Malaysia;Universiti Teknologi PETRONAS, Perak, Malaysia

  • Venue:
  • Proceedings of the International Conference on Management of Emergent Digital EcoSystems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Computational grid has the potential for solving large-scale scientific problems using distributed resources. Grid scheduling is a vital component of a Computational Grid infrastructure. In this paper, we evaluate our proposed Grid scheduling algorithms (the Multilevel Hybrid Scheduling Algorithm and the Multilevel Dual Queue Scheduling Algorithm) using real workload traces, taken from leading computational centers. An extensive performance comparison is presented using real workload traces to evaluate the efficiency of scheduling algorithms. To facilitate the research, a software tool has been developed which produces a comprehensive simulation of a number of Grid scheduling algorithms. The tool's output is in the form of scheduling performance metrics. The experimental results, based on performance metrics, demonstrate that the performances of our Grid scheduling algorithms give good results. Our proposed scheduling algorithms also support true scalability, that is, they maintain an efficient approach when increasing the number of CPUs or nodes. This paper also includes a statistical analysis of workload traces to present the nature and behavior of jobs.