Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness

  • Authors:

  • Ashish M. Mehta;Jay Smith;H. J. Siegel;Anthony A. Maciejewski;Arun Jayaseelan;Bin Ye

  • Affiliations:

  • Electrical and Computer Engineering Department, Colorado State University, Fort Collins, USA 80523-1373;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, USA 80523-1373 and IBM, Boulder, USA 80301;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, USA 80523-1373 and Computer Science Department, Colorado State University, Fort Collins, USA 80523-1373;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, USA 80523-1373;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, USA 80523-1373;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, USA 80523-1373

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Heterogeneous parallel and distributed computing systems may operate in an environment where certain system performance features degrade due to unpredictable circumstances. Robustness can be defined as the degree to which a system can function correctly in the presence of parameter values different from those assumed. This work develops a model for quantifying robustness in a dynamic heterogeneous computing environment where task execution time estimates are known to contain errors. This mathematical expression of robustness is then applied to two different problem environments. Several heuristic solutions to both problem variations are presented that utilize this expression of robustness to influence mapping decisions.