Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems

Authors:
Jack J. Dongarra;Emmanuel Jeannot;Erik Saule;Zhiao Shi
Affiliations:
University of Tennessee, Knoxville, TN;INRIA-Lorraine, LORIA, Villers les Nancy, France;ID-IMAG/LIG, Montbonnot St. Martin, France;University of Tennessee, Knoxville, TN
Venue:
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Year:
2007

Citing 10
Cited 25

Matching and Scheduling Algorithms for Minimizing Execution Time and Failure Probability of Applications in Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures

IEEE Transactions on Parallel and Distributed Systems
A Static Scheduling Heuristic for Heterogeneous Processors

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
On the approximability of trade-offs and optimal access of Web sources

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems

HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Task Scheduling Algorithms for Heterogeneous Processors

HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Triplet: A Clustering Scheduling Algorithm for Heterogeneous Systems

ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Biobjective Scheduling Algorithms for Execution Time–Reliability Trade-off in Heterogeneous Computing Systems*

The Computer Journal
Scalable fault tolerant protocol for parallel runtime environments

EuroPVM/MPI'06 Proceedings of the 13th European PVM/MPI User's Group conference on Recent advances in parallel virtual machine and message passing interface

Bi-objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines

Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Reliability versus performance for critical applications

Journal of Parallel and Distributed Computing
Analyzing scheduling with transient failures

Information Processing Letters
Reliability-Oriented Genetic Algorithm for Workflow Applications Using Max-Min Strategy

CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Combined Fault Tolerance and Scheduling Techniques for Workflow Applications on Computational Grids

CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Multiobjective evolutionary computation algorithms for solving task scheduling problem on heterogeneous systems

International Journal of Knowledge-based and Intelligent Engineering Systems
Robust task scheduling for volunteer computing systems

The Journal of Supercomputing
An efficient weighted bi-objective scheduling algorithm for heterogeneous systems

Euro-Par'09 Proceedings of the 2009 international conference on Parallel processing
Application and comparison of hybrid evolutionary multiobjective optimization algorithms for solving task scheduling problem on heterogeneous systems

Applied Soft Computing
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems

SIAM Journal on Computing
Optimizing the makespan and reliability for workflow applications with reputation and a look-ahead genetic algorithm

Future Generation Computer Systems
An efficient weighted bi-objective scheduling algorithm for heterogeneous systems

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

Journal of Parallel and Distributed Computing
Flexible service selection with user-specific QoS support in service-oriented architecture

Journal of Network and Computer Applications
Multiple Workflow Scheduling Strategies with User Run Time Estimates on a Grid

Journal of Grid Computing
Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms

Journal of Scheduling
Cost- and deadline-constrained provisioning for scientific workflow ensembles in IaaS clouds

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Fair solutions for some multiagent optimization problems

Autonomous Agents and Multi-Agent Systems
Trust services-oriented multi-objects workflow scheduling model for cloud computing

ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
Reliability and performance optimization of pipelined real-time systems

Journal of Parallel and Distributed Computing
Reliable workflow scheduling with less resource redundancy

Parallel Computing
Distributed Throughput Optimization for Large-Scale Scientific Workflows Under Fault-Tolerance Constraint

Journal of Grid Computing
Distributed workflow mapping algorithm for maximized reliability under end-to-end delay constraint

The Journal of Supercomputing
Load balanced reliable task scheduling algorithm for heterogeneous systems

Journal of High Speed Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We tackle the problem of scheduling task graphs onto a heterogeneous set of machines, where each processor has a probability of failure governed by an exponential law. The goal is to design algorithms that optimize both makespan and reliability. First, we provide an optimal scheduling algorithm for independent unitary tasks where the objective is to maximize the reliability subject to makespan minimization. For the bi-criteria case, we provide an algorithm that approximates the Pareto-curve. Next, for independent non-unitary tasks, we show that the product {failure rate}x {unitary instruction execution time} is crucial to distinguish processors in this context. Based on these results we are able to let the user choose a trade-off between reliability maximization and makespan minimization. For general task graphs we provide a method for converting scheduling heuristics on heterogeneous cluster into heuristics that take reliability into account. Here again, we show how we can help the user to select a trade-off between makespan and reliability.