An algorithm for real-time fault-tolerant scheduling in multiprocessor systems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

18 Scopus citations

Abstract

We consider using hardware and software redundancy to guarantee task deadlines in a hard real-time mu1 tiprocessor system even in the presence of processor failures. A set of scheduling requirements for the real-time fault-tolerant multiprocessor scheduling problem is first identified and a heuristic algorithm is then proposed to solve the problem. Experimental results show that the algorithm finds optimal solutions in most of the cases.

Original languageEnglish
Title of host publicationProceedings - 4th Euromicro Workshop on Real-Time Systems, ECRTS 1992
Pages190-195
Number of pages6
DOIs
StatePublished - 1992
Event4th Euromicro Workshop on Real-Time Systems, ECRTS 1992 - Athens, Greece
Duration: 3 Jun 19925 Jun 1992

Publication series

NameProceedings - Euromicro Conference on Real-Time Systems
ISSN (Print)1068-3070

Conference

Conference4th Euromicro Workshop on Real-Time Systems, ECRTS 1992
Country/TerritoryGreece
CityAthens
Period3/06/925/06/92

Fingerprint

Dive into the research topics of 'An algorithm for real-time fault-tolerant scheduling in multiprocessor systems'. Together they form a unique fingerprint.

Cite this