Managing Risk of Inaccurate Runtime Estimates for Deadline Constrained Job Admission Control in Clusters

  • Authors:
  • Chee Shin Yeo;Rajkumar Buyya

  • Affiliations:
  • The University of Melbourne, Australia;The University of Melbourne, Australia

  • Venue:
  • ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The advent of service-oriented Grid computing has resulted in the need for Grid resources such as clusters to enforce user-specific service needs and expectations. Service Level Agreements (SLAs) define conditions which a cluster needs to fulfill for various jobs. An example of SLA requirement is the deadline by which a job has to be completed. In addition, these clusters implement job admission control so that overall service performance does not deteriorate due to accepting exceeding amount of jobs. However, their effectiveness is highly dependent on accurate runtime estimates of jobs. This paper thus examines the adverse impact of inaccurate runtime estimates for deadline constrained job admission control in clusters using the Earliest Deadline First (EDF) strategy and a deadline-based proportional processor share strategy called Libra. Simulation results show that an enhancement called LibraRisk can manage the risk of inaccurate runtime estimates better than EDF and Libra by considering the risk of deadline delay.