Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments

Authors:
Louis-Claude Canon;Emmanuel Jeannot
Affiliations:
LORIA, INRIA, CNRS and Nancy University, Vandoeuvrelès-Nancy;LORIA, INRIA, CNRS and Nancy University, Villers les Nancy
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2010

Citing 0
Cited 5

Optimizing performance and reliability on heterogeneous parallel systems: Approximation algorithms and heuristics

Journal of Parallel and Distributed Computing
Heterogeneous makespan and energy-constrained DAG scheduling

Proceedings of the 2013 workshop on Energy efficient high performance parallel and distributed computing
Stochastic DAG scheduling using a Monte Carlo approach

Journal of Parallel and Distributed Computing
Robust static resource allocation of DAGs in a heterogeneous multicore system

Journal of Parallel and Distributed Computing
Maximizing stochastic robustness of static resource allocations in a periodic sensor driven cluster

Future Generation Computer Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

A schedule is said to be robust if it is able to absorb some degree of uncertainty in task or communication durations while maintaining a stable solution. This intuitive notion of robustness has led to a lot of different metrics and almost no heuristics. In this paper, we perform an experimental study of these different metrics and show how they are correlated to each other. Additionally, we propose different strategies for minimizing the makespan while maximizing the robustness: from an evolutionary metaheuristic (best solutions but longer computation time) to more simple heuristics making approximations (medium quality solutions but fast computation time). We compare these different approaches experimentally and show that we are able to find different approximations of the Pareto front for this bicriteria problem.