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

DOI10.1016/j.jpdc.2011.11.003zbMath1242.68037MaRDI QIDQ433416

Denis Trystram, Erik Saule, Emmanuel Jeannot

Publication date: 13 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2011.11.003

zbMATH Keywords

scheduling; reliability; makespan; Pareto-front approximation; precedence task graphs

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics, Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics
• Static worksharing strategies for heterogeneous computers with unrecoverable interruptions
• Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms
• An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Bounds for LPT Schedules on Uniform Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS
• Scheduling