Fault tolerant scheduling of interval ordered tasks with communication in a multiprocessor system

Mohana Desiraju, Hesham H. Ali

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This work is intended to present an efficient technique to produce a fault tolerant schedule for a task graph while considering communication costs. It is well known that when communication costs are considered, optimal algorithms exist for special cases like Interval Ordered graphs and Tree structured graphs on two processors [1,2, 3]. Following this fact, this paper provides an optimal Fault Tolerant schedule for the Interval Graphs and a near optimal Fault Tolerant schedule for the non-Interval Order graphs by converting them into Interval Orders. The importance of this algorithm is that the communication costs are not ignored.

Original languageEnglish (US)
Title of host publicationProceedings of the IASTED International Multi-Conference on Applied Informatics
EditorsT. Fahringer, M.H. Hamza
Pages559-564
Number of pages6
StatePublished - 2005
EventIASTED International Conference on Parallel and Distributed Computing and Networks, as part of the 23rd IASTED International Multi-Conference on Applied Informatics - Innsbruck, Austria
Duration: Feb 15 2005Feb 17 2005

Other

OtherIASTED International Conference on Parallel and Distributed Computing and Networks, as part of the 23rd IASTED International Multi-Conference on Applied Informatics
CountryAustria
CityInnsbruck
Period2/15/052/17/05

Keywords

  • Backup task
  • Communication delay
  • Fault Tolerance
  • Interval Order task graph
  • Primary task
  • Scheduling

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Fault tolerant scheduling of interval ordered tasks with communication in a multiprocessor system'. Together they form a unique fingerprint.

Cite this