Abstract
An algorithm for scheduling real-time periodic tasks on a multiprocessor system under a fault-tolerant requirement is presented. The approach incorporates both the redundancy and masking technique, and the imprecise computation model. Since the tasks in hard real-time systems have stringent timing constraints, the redundancy and masking technique is more appropriate than the rollback techniques, which usually require extra time for error recovery. The imprecise computation model provides flexible functionality by trading off the quality of the result produced by a task with the amount of processing time required to produce it. It therefore permits the performance of a real-time system to degrade gracefully. The algorithm was evaluated by stochastic analysis and Monte Carlo simulations. The results showed that the algorithm was resilient under hardware failure.
Original language | English |
---|---|
Title of host publication | 11th Annual International Phoenix Conference on Computers and Communication, IPCCC 1992 - Proceedings |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 395-402 |
Number of pages | 8 |
ISBN (Electronic) | 0780306058, 9780780306059 |
DOIs | |
State | Published - 1992 |
Externally published | Yes |
Event | 11th Annual International Phoenix Conference on Computers and Communication, IPCCC 1992 - Scottsdale, United States Duration: 01 04 1992 → 03 04 1992 |
Publication series
Name | 11th Annual International Phoenix Conference on Computers and Communication, IPCCC 1992 - Proceedings |
---|
Conference
Conference | 11th Annual International Phoenix Conference on Computers and Communication, IPCCC 1992 |
---|---|
Country/Territory | United States |
City | Scottsdale |
Period | 01/04/92 → 03/04/92 |
Bibliographical note
Publisher Copyright:© 1992 IEEE.