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ženo v:

Podrobná bibliografie
Vydáno v:	Journal of parallel and distributed computing Ročník 72; číslo 2; s. 268 - 280
Hlavní autoři:	Jeannot, Emmanuel, Saule, Erik, Trystram, Denis
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Inc 01.02.2012 Elsevier
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!