Scheduling parallel applications on utility grids: time and cost trade-off management

  • Authors:

  • Saurabh Kumar Garg;Rajkumar Buyya;H. J. Siegel

  • Affiliations:

  • The University of Melbourne, Victoria, Australia;The University of Melbourne, Victoria, Australia;Colorado State University, Fort Collins

  • Venue:
  • ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the growth of Utility Grids and various Grid market infrastructures, the need for efficient and cost effective scheduling algorithms is also increasing rapidly, particularly in the area of meta-scheduling. In these environments, users not only may have conflicting requirements with other users, but also they have to manage the trade-off between time and cost such that their applications can be executed most economically in the minimum time. Thus, choosing of the best Grid resources becomes a challenge in such a competitive market. This paper presents two novel heuristics for scheduling parallel applications on Utility Grids that manage and optimize the trade-off between time and cost constraints. The performance of the heuristics is evaluated through extensive simulations of a real-world environment with real parallel workload models to demonstrate the practicality of our algorithms. We compare our scheduling algorithms against other common algorithms used by current meta-schedulers. The results shows that our algorithms outperform other algorithms by minimizing the time and cost of application execution on Utility Grids.