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

Fingerprint

Scheduling
Communication
Costs

Keywords

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

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Desiraju, M., & Ali, H. H. (2005). Fault tolerant scheduling of interval ordered tasks with communication in a multiprocessor system. In T. Fahringer, & M. H. Hamza (Eds.), Proceedings of the IASTED International Multi-Conference on Applied Informatics (pp. 559-564). [456-229]

Fault tolerant scheduling of interval ordered tasks with communication in a multiprocessor system. / Desiraju, Mohana; Ali, Hesham H.

Proceedings of the IASTED International Multi-Conference on Applied Informatics. ed. / T. Fahringer; M.H. Hamza. 2005. p. 559-564 456-229.

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

Desiraju, M & Ali, HH 2005, Fault tolerant scheduling of interval ordered tasks with communication in a multiprocessor system. in T Fahringer & MH Hamza (eds), Proceedings of the IASTED International Multi-Conference on Applied Informatics., 456-229, pp. 559-564, IASTED International Conference on Parallel and Distributed Computing and Networks, as part of the 23rd IASTED International Multi-Conference on Applied Informatics, Innsbruck, Austria, 2/15/05.
Desiraju M, Ali HH. Fault tolerant scheduling of interval ordered tasks with communication in a multiprocessor system. In Fahringer T, Hamza MH, editors, Proceedings of the IASTED International Multi-Conference on Applied Informatics. 2005. p. 559-564. 456-229
Desiraju, Mohana ; Ali, Hesham H. / Fault tolerant scheduling of interval ordered tasks with communication in a multiprocessor system. Proceedings of the IASTED International Multi-Conference on Applied Informatics. editor / T. Fahringer ; M.H. Hamza. 2005. pp. 559-564
@inproceedings{a77ef310c1474a578629cc4558bee279,
title = "Fault tolerant scheduling of interval ordered tasks with communication in a multiprocessor system",
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.",
keywords = "Backup task, Communication delay, Fault Tolerance, Interval Order task graph, Primary task, Scheduling",
author = "Mohana Desiraju and Ali, {Hesham H}",
year = "2005",
language = "English (US)",
pages = "559--564",
editor = "T. Fahringer and M.H. Hamza",
booktitle = "Proceedings of the IASTED International Multi-Conference on Applied Informatics",

}

TY - GEN

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

AU - Desiraju, Mohana

AU - Ali, Hesham H

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - Backup task

KW - Communication delay

KW - Fault Tolerance

KW - Interval Order task graph

KW - Primary task

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=27944508708&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27944508708&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:27944508708

SP - 559

EP - 564

BT - Proceedings of the IASTED International Multi-Conference on Applied Informatics

A2 - Fahringer, T.

A2 - Hamza, M.H.

ER -