On the Robustness Of Metaprogram Schedules

Authors:
Ladislau Boloni;Dan C. Marinescu
Affiliations:
-;-
Venue:
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Year:
1999

Citing 2
Cited 1

Linear network optimization: algorithms and codes

Linear network optimization: algorithms and codes
On-line use of off-line derived mappings for iterative automatic target recognition tasks and a particular class of hardware platforms

HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)

A case for on-machine load balancing

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

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.