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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of parallel and distributed computing Ročník 72; číslo 2; s. 268 - 280
Hlavní autori:	Jeannot, Emmanuel, Saule, Erik, Trystram, Denis
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.02.2012 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!