Processor allocation for tasks that is robust against errors in computation time estimates

• Main Authors: Sugavanam, P.V., Siegel, H.J., Maciejewski, A.A., Ali, S.A., Al-Otaibi, M., Aydin, M., Guru, K., Horiuchi, A., Krishnamurthy, Y.G., Lee, P., Mehta, A., Oltikar, O., Pichel, R., Pippin, A.J., Raskey, M., Shestak, V., Zhang, J.
• Format: Conference Proceeding
• Language: English
• Subjects: Active appearance model; Computer science; Educational technology; Linux; Parameter estimation; Production; Resource management; Robustness; State estimation; Very large scale integration
• ISSN: 1530-2075
• DOI: 10.1109/IPDPS.2005.362

Heterogeneous computing systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be sudden machine failures, higher than expected load, or inaccuracies in estimation of system parameters. Makespan (defined as the completion time for an entire set of tasks) is often the performance feature that is optimized in such systems. It is important that the makespan of a resource allocation (mapping) be robust against errors in task computation time estimates. The problem of optimally mapping tasks onto machines of a heterogeneous computing environment has been shown, in general, to be NP-complete. Therefore, heuristic techniques to find near optimal solutions to this mapping problem are required. The goal of this research is to find a static mapping of tasks so that the robustness of the desired system feature, makespan, is maximized against the errors in task execution time estimates. Seven heuristics to derive near-optimal solutions and an upper bound to this problem are presented and evaluated.