Trading off Execution Time for Reliability in Scheduling Precedence-Constrained Tasks in Heterogeneous Computing

  • Authors:
  • Affiliations:
  • Venue:
  • IPDPS '01 Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS'01) - Volume 1
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper investigates the problem of matching andscheduling of an application, which is composed of taskswith precedence constraints, to minimize both executiontime and probability of failure of the application in a heterogeneous computing system. In general, however, it is impossible to satisfy both objectives at the same time because of conflicting requirements. The best one can do isto trade off execution time for reliability, or vice versa, accordingto users' needs. Furthermore, there is a need for analgorithm which can assign tasks of an application to satisfyboth of the objectives to some degree. Motivated fromthese facts, two different algorithms, which are capable oftrading off execution time for reliability, are developed. Toenable the proposed algorithms to account for the reliabilityof resources in the system, an expression which gives thereliability of the application under a given task assignmentis derived. The simulation results are provided to validatethe performance of the proposed algorithms.