Optimal and Suboptimal Reliable Scheduling of Precedence-Constrained Tasks in Heterogeneous Distributed Computing

Authors:
Atakan Dogan;Füsun Özgüner
Affiliations:
-;-
Venue:
ICPP '00 Proceedings of the 2000 International Workshop on Parallel Processing
Year:
2000

Citing 0
Cited 3

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

IEEE Transactions on Parallel and Distributed Systems
Reliability-aware scheduling strategy for heterogeneous distributed computing systems

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

Journal of Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces algorithms, which can produce both optimal, and suboptimal task assignments to minimize the probability of failure of an application executing on a heterogeneous distributed computing system. A cost function which defines this probability under a given task assignment is derived. To find optimal and suboptimal task assignments efficiently, the reliable matching and scheduling problem is converted to the state-space search problem in which the cost function derived is used to guide the search. The A* algorithm for finding optimal task assignments and the \math and hill-climbing algorithms for finding suboptimal task assignments are presented. The simulation results are provided to confirm the performance of the proposed algorithms.