Article

The Journal of Supercomputing

, Volume 42, Issue 1, pp 33-58

Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness

  • Ashish M. MehtaAffiliated withElectrical and Computer Engineering Department, Colorado State University
  • , Jay SmithAffiliated withElectrical and Computer Engineering Department, Colorado State UniversityIBM
  • , H. J. SiegelAffiliated withElectrical and Computer Engineering Department, Colorado State UniversityComputer Science Department, Colorado State University Email author 
  • , Anthony A. MaciejewskiAffiliated withElectrical and Computer Engineering Department, Colorado State University
  • , Arun JayaseelanAffiliated withElectrical and Computer Engineering Department, Colorado State University
  • , Bin YeAffiliated withElectrical and Computer Engineering Department, Colorado State University

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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.

Keywords

Resource management Robustness Dynamic mapping Makespan Resource allocation