The Journal of Supercomputing

, Volume 42, Issue 1, pp 33–58

Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness

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

DOI: 10.1007/s11227-006-0035-y

Cite this article as:
Mehta, A.M., Smith, J., Siegel, H.J. et al. J Supercomput (2007) 42: 33. doi:10.1007/s11227-006-0035-y

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 managementRobustnessDynamic mappingMakespanResource allocation

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Ashish M. Mehta
    • 1
  • Jay Smith
    • 1
    • 2
  • H. J. Siegel
    • 1
    • 3
  • Anthony A. Maciejewski
    • 1
  • Arun Jayaseelan
    • 1
  • Bin Ye
    • 1
  1. 1.Electrical and Computer Engineering DepartmentColorado State UniversityFort CollinsUSA
  2. 2.IBMBoulderUSA
  3. 3.Computer Science DepartmentColorado State UniversityFort CollinsUSA