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

We study the problem of scheduling tasks (with and without precedence constraints) on a set of related processors which have a probability of failure governed by an exponential law. The goal is to design approximation algorithms or heuristics that optimize both makespan and reliability. First, we sh...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of parallel and distributed computing Vol. 72; no. 2; pp. 268 - 280
Main Authors:	Jeannot, Emmanuel, Saule, Erik, Trystram, Denis
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.02.2012 Elsevier
Subjects:	Algorithms Approximation Computer Science Distributed, Parallel, and Cluster Computing Heuristic Makespan Mathematical models Optimization Pareto-front approximation Precedence task graphs Processors Reliability Scheduling Tasks Pareto-front approximation Scheduling Makespan Reliability Precedence task graphs Precedence Task Graphs
ISSN:	0743-7315, 1096-0848
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!