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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of parallel and distributed computing Jg. 72; H. 2; S. 268 - 280
Hauptverfasser:	Jeannot, Emmanuel, Saule, Erik, Trystram, Denis
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.02.2012 Elsevier
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!