The Community for Technology Leaders
Heterogeneous Computing Workshop (1999)
San Juan, Puerto Rico
Apr. 12, 1999 to Apr. 12, 1999
ISSN: 1097-5209
ISBN: 0-7695-0107-9
pp: 146
ABSTRACT
Scheduling meta applications on a computational grid uses estimation of the execution times of component programs to compute optimal schedules. In a realistic case various factors (hazards) lead to estimation errors, which affect both the performance of a schedule and resource utilization.We introduce the concept of robustness and present an analysis technique to determine the robustness of a schedule. We develop methods for reducing the chance that a metaprogram exceeds its execution time due to components outside its critical path. The results of this analysis are used to compute schedules less sensitive to hazards. This translates into more accurate reservation requirements for critical systems, and reduced expected execution time for non-critical metaprograms executed repeatedly. Simulation results prove the efficiency and applicability of our algorithms.
INDEX TERMS
CITATION

L. Boloni and D. C. Marinescu, "On the Robustness Of Metaprogram Schedules," Heterogeneous Computing Workshop(HCW), San Juan, Puerto Rico, 1999, pp. 146.
doi:10.1109/HCW.1999.765120
98 ms
(Ver 3.3 (11022016))