AN ALGORITHM AND SOME NUMERICAL EXPERIMENTS FOR THE SCHEDULING OF TASKS WITH FAULT-TOLERANCY CONSTRAINTS ON HETEROGENEOUS SYSTEMS - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

AN ALGORITHM AND SOME NUMERICAL EXPERIMENTS FOR THE SCHEDULING OF TASKS WITH FAULT-TOLERANCY CONSTRAINTS ON HETEROGENEOUS SYSTEMS

Abstract

In this paper, we propose an efficient scheduling algorithm for problems in which tasks with precedence constraints and communication delays have to be scheduled on an heterogeneous distributed system with an one fault hypothesis. Based on an extension of the Critical-Path Method CPM/PERT, our algorithm combines an optimal schedule with some additional tasks duplication, to provide fault-tolerance. Backup copies are not established for tasks that have already more than one original copy. The result is a schedule in polynomial time that is optimal when there is no failure, and is a good resilient schedule in the case of one server failure. We finally compare the optimal solutions with the resilient solutions found by this algorithm on several semi-random DAGs.
Fichier principal
Vignette du fichier
hpcs_08.pdf (527.53 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00429456 , version 1 (03-11-2009)

Identifiers

  • HAL Id : hal-00429456 , version 1

Cite

Moustafa Nakechbandi, Jean-Yves Colin. AN ALGORITHM AND SOME NUMERICAL EXPERIMENTS FOR THE SCHEDULING OF TASKS WITH FAULT-TOLERANCY CONSTRAINTS ON HETEROGENEOUS SYSTEMS. High Performance Computing & Simulation Conference (HPCS 2008), Jun 2008, Nicosia, Cyprus. pp.326-332. ⟨hal-00429456⟩
60 View
136 Download

Share

Gmail Mastodon Facebook X LinkedIn More