Robust static allocation of resources for independent tasks under makespan and dollar cost constraints

  • Authors:

  • Prasanna Sugavanam;H. J. Siegel;Anthony A. Maciejewski;Mohana Oltikar;Ashish Mehta;Ron Pichel;Aaron Horiuchi;Vladimir Shestak;Mohammad Al-Otaibi;Yogish Krishnamurthy;Syed Ali;Junxing Zhang;Mahir Aydin;Panho Lee;Kumara Guru;Michael Raskey;Alan Pippin

  • Affiliations:

  • Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO 80523, USA;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO 80523, USA and Computer Science Department, Colorado State University, Fort Collins, CO 80523, USA;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO 80523, USA;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO 80523, USA;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO 80523, USA;Systems and VLSI Technology Division, Hewlett-Packard Company, Fort Collins, CO 80528, USA;Systems and VLSI Technology Division, Hewlett-Packard Company, Fort Collins, CO 80528, USA;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO 80523, USA;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO 80523, USA;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO 80523, USA;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO 80523, USA;School of Computing, University of Utah, Salt Lake City, UT 84112, USA;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO 80523, USA;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO 80523, USA;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO 80523, USA;Systems and VLSI Technology Division, Hewlett-Packard Company, Fort Collins, CO 80528, USA;Linux and Open Source Lab, Hewlett-Packard Company, Fort Collins, CO 80528, USA

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Heterogeneous computing (HC) systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be inaccuracies in the estimation of task execution times. Makespan (defined as the completion time for an entire set of tasks) is often the performance feature that needs to be optimized in such systems. Resource allocation is typically performed based on estimates of the computation time of each task on each class of machines. Hence, it is important that makespan be robust against errors in computation time estimates. In this research, the problem of finding a static mapping of tasks to maximize the robustness of makespan against the errors in task execution time estimates given an overall makespan constraint is studied. Two variations of this basic problem are considered: (1) where there is a given, fixed set of machines, (2) where an HC system is to be constructed from a set of machines within a dollar cost constraint. Six heuristic techniques for each of these variations of the problem are presented and evaluated.