Task reallocation for fault tolerance in multiprocessor systems

Chien In Henry Chen, Vladimir Cherkassky

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

1 Scopus citations


A simple, yet effective, method to improve multicomputer/multiprocessor system reliability via redundant allocation of tasks to computers (processors) is described. Given any known (nonredundant) scheduling strategy, tasks are allocated to processors statically and redundantly using the k-circular shifting algorithm, so that if some processors fail during the execution all tasks can be completed on the remaining processors (but in a longer time). Due to static preallocation of tasks this method is simpler and thus more practical than well-known dynamic reconfiguration and roll-back recovery techniques in multiprocessor systems. The authors discuss in detail the redundant allocation of independent tasks to identical processors, subject to real-time constraints on total execution time, and derive analytic reliability estimates for this case. The longest processing time (LPT) scheduling is given as an example of nonredundant deterministic scheduling for independent tasks. Finally, the authors discuss processor utilization for redundant task allocation, and compare it with the standby redundancy technique. This comparison shows that the proposed method achieves much higher processor utilization than standby redundancy.

Original languageEnglish (US)
Title of host publicationIEEE Proceedings of the National Aerospace and Electronics Conference
PublisherPubl by IEEE
Number of pages6
StatePublished - Dec 1 1990
EventProceedings of the IEEE 1990 National Aerospace and Electronics Conference - NAECON 1990 - Dayton, OH, USA
Duration: May 21 1990May 25 1990


OtherProceedings of the IEEE 1990 National Aerospace and Electronics Conference - NAECON 1990
CityDayton, OH, USA


Dive into the research topics of 'Task reallocation for fault tolerance in multiprocessor systems'. Together they form a unique fingerprint.

Cite this