Ye, Bin, authorJayaseelan, Arun, authorMaciejewski, Anthony A., authorSiegel, H. J., authorSmith, Jay, authorMehta, Ashish, authorCSREA Press, publisher2007-01-032007-01-032006Mehta, Ashish, M., et al., Dynamic Resource Allocation Heuristics for Maximizing Robustness with an Overall Makespan Constraint in an Uncertain Environment, [International Conference on Parallel and Distributed Processing Technqiues and Applications: PDPTA '06: June 26-29, 2006, Monte Carlo Resort, Las Vegas, Nevada, USA: 7 p.].http://hdl.handle.net/10217/67391Heterogeneous 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 uses a mathematic expression of robustness for a dynamic environment where task execution time estimates are known to contain errors. Several heuristic solutions to the problem are presented that utilize this expression of robustness to influence mapping decisions. These solutions are then compared to a bound on the highest attainable robustness of the described system.born digitalproceedings (reports)eng©2006 CSREA Press.Copyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright.dynamic heuristicsmakespanrobustnessresource allocationText