An evolutionary approach for real-time fault-tolerant multiprocessor scheduling

Yoshitsugu Hashimoto, Hesham H Ali

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

Abstract

Recently, the number of applications demanding real-time performance from their multiprocessor systems has been significantly increasing. At the same time, due to the possible catastrophic consequences from missing deadlines, fault-tolerance has become a critical issue in real-time systems. However, only a few heuristic algorithms have been proposed to solve fault-tolerant scheduling problems in multiprocessor systems. As an alternative to traditional heuristic algorithms, several optimization methods such as simulated annealing, tabu search, and genetic algorithms have been adapted to solve various NP-complete problems and proven their effectiveness. Nonetheless, almost none of these methods have been used for fault-tolerant scheduling problems. In this paper, we present a genetic algorithm and take a new approach to address real-time fault-tolerant scheduling. We also modified the existing branch-and-bound (B&B) algorithm to fit into our problem and compare these two algorithms. The simulation results show that the genetic algorithm outperforms the B&B algorithm in almost all cases.

Original languageEnglish (US)
Title of host publicationProceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
EditorsT. Gonzalez
Pages473-478
Number of pages6
Volume16
StatePublished - 2004
EventProceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems - Cambridge, MA, United States
Duration: Nov 9 2004Nov 11 2004

Other

OtherProceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems
CountryUnited States
CityCambridge, MA
Period11/9/0411/11/04

Fingerprint

Genetic algorithms
Scheduling
Heuristic algorithms
Tabu search
Fault tolerance
Real time systems
Simulated annealing
Computational complexity

Keywords

  • Fault-tolerant systems
  • Genetic algorithms
  • Real-time scheduling
  • Task scheduling

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Hashimoto, Y., & Ali, H. H. (2004). An evolutionary approach for real-time fault-tolerant multiprocessor scheduling. In T. Gonzalez (Ed.), Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems (Vol. 16, pp. 473-478). [439-116]

An evolutionary approach for real-time fault-tolerant multiprocessor scheduling. / Hashimoto, Yoshitsugu; Ali, Hesham H.

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems. ed. / T. Gonzalez. Vol. 16 2004. p. 473-478 439-116.

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

Hashimoto, Y & Ali, HH 2004, An evolutionary approach for real-time fault-tolerant multiprocessor scheduling. in T Gonzalez (ed.), Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems. vol. 16, 439-116, pp. 473-478, Proceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems, Cambridge, MA, United States, 11/9/04.
Hashimoto Y, Ali HH. An evolutionary approach for real-time fault-tolerant multiprocessor scheduling. In Gonzalez T, editor, Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems. Vol. 16. 2004. p. 473-478. 439-116
Hashimoto, Yoshitsugu ; Ali, Hesham H. / An evolutionary approach for real-time fault-tolerant multiprocessor scheduling. Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems. editor / T. Gonzalez. Vol. 16 2004. pp. 473-478
@inproceedings{6051ea3846254c8a9224ed31048a7f22,
title = "An evolutionary approach for real-time fault-tolerant multiprocessor scheduling",
abstract = "Recently, the number of applications demanding real-time performance from their multiprocessor systems has been significantly increasing. At the same time, due to the possible catastrophic consequences from missing deadlines, fault-tolerance has become a critical issue in real-time systems. However, only a few heuristic algorithms have been proposed to solve fault-tolerant scheduling problems in multiprocessor systems. As an alternative to traditional heuristic algorithms, several optimization methods such as simulated annealing, tabu search, and genetic algorithms have been adapted to solve various NP-complete problems and proven their effectiveness. Nonetheless, almost none of these methods have been used for fault-tolerant scheduling problems. In this paper, we present a genetic algorithm and take a new approach to address real-time fault-tolerant scheduling. We also modified the existing branch-and-bound (B&B) algorithm to fit into our problem and compare these two algorithms. The simulation results show that the genetic algorithm outperforms the B&B algorithm in almost all cases.",
keywords = "Fault-tolerant systems, Genetic algorithms, Real-time scheduling, Task scheduling",
author = "Yoshitsugu Hashimoto and Ali, {Hesham H}",
year = "2004",
language = "English (US)",
volume = "16",
pages = "473--478",
editor = "T. Gonzalez",
booktitle = "Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems",

}

TY - GEN

T1 - An evolutionary approach for real-time fault-tolerant multiprocessor scheduling

AU - Hashimoto, Yoshitsugu

AU - Ali, Hesham H

PY - 2004

Y1 - 2004

N2 - Recently, the number of applications demanding real-time performance from their multiprocessor systems has been significantly increasing. At the same time, due to the possible catastrophic consequences from missing deadlines, fault-tolerance has become a critical issue in real-time systems. However, only a few heuristic algorithms have been proposed to solve fault-tolerant scheduling problems in multiprocessor systems. As an alternative to traditional heuristic algorithms, several optimization methods such as simulated annealing, tabu search, and genetic algorithms have been adapted to solve various NP-complete problems and proven their effectiveness. Nonetheless, almost none of these methods have been used for fault-tolerant scheduling problems. In this paper, we present a genetic algorithm and take a new approach to address real-time fault-tolerant scheduling. We also modified the existing branch-and-bound (B&B) algorithm to fit into our problem and compare these two algorithms. The simulation results show that the genetic algorithm outperforms the B&B algorithm in almost all cases.

AB - Recently, the number of applications demanding real-time performance from their multiprocessor systems has been significantly increasing. At the same time, due to the possible catastrophic consequences from missing deadlines, fault-tolerance has become a critical issue in real-time systems. However, only a few heuristic algorithms have been proposed to solve fault-tolerant scheduling problems in multiprocessor systems. As an alternative to traditional heuristic algorithms, several optimization methods such as simulated annealing, tabu search, and genetic algorithms have been adapted to solve various NP-complete problems and proven their effectiveness. Nonetheless, almost none of these methods have been used for fault-tolerant scheduling problems. In this paper, we present a genetic algorithm and take a new approach to address real-time fault-tolerant scheduling. We also modified the existing branch-and-bound (B&B) algorithm to fit into our problem and compare these two algorithms. The simulation results show that the genetic algorithm outperforms the B&B algorithm in almost all cases.

KW - Fault-tolerant systems

KW - Genetic algorithms

KW - Real-time scheduling

KW - Task scheduling

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

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

M3 - Conference contribution

VL - 16

SP - 473

EP - 478

BT - Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

A2 - Gonzalez, T.

ER -