NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
A Scheduling Algorithm for Replicated Real-Time TasksWe present an algorithm for scheduling real-time periodic tasks on a multiprocessor system under fault-tolerant requirement. Our 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 are 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. We evaluate the algorithm by stochastic analysis and Monte Carlo simulations. The results show that the algorithm is resilient under hardware failures.
Document ID
19970001655
Acquisition Source
Ames Research Center
Document Type
Conference Paper
Authors
Yu, Albert C.
(Illinois Univ. Urbana-Champaign, IL United States)
Lin, Kwei-Jay
(Illinois Univ. Urbana-Champaign, IL United States)
Date Acquired
August 17, 2013
Publication Date
October 18, 1991
Publication Information
Publication: NASA Review of ICLASS
Subject Category
Computer Programming And Software
Meeting Information
Meeting: Computers and Communications
Location: Phoenix, AZ
Country: United States
Start Date: January 1, 1992
Sponsors: Institute of Electrical and Electronics Engineers
Accession Number
97N70109
Funding Number(s)
CONTRACT_GRANT: NAG1-613
CONTRACT_GRANT: N00014-89-J-1181
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.
Document Inquiry

Available Downloads

There are no available downloads for this record.
No Preview Available