Dedicated to the memory of my father Predictability and fault tolerance are major requirements for complex real-time systems, which are either safety or mission critical. Traditionally fault tolerant techniques were employed to tackle the problem of ensuring correctness in the value domain only. We stress that the fault tolerance requirements and timing constraints are not orthogonal issues as they appear to be, and hence any viable approach must be an integrated one. Fault tolerance in a real-time system implies that the system is able to deliver correct results in a timely manner even in the presence of faults. Techniques employing time redundancy are commonly used for tolerating a wide class of faults such as transient faults. In these systems, it is essential that the exploitation of time redundancy for correctness does not jeopardize the timeliness attribute. Hence scheduling aspects of fault tolerant real-time systems become all the more important. The research work described in this thesis, focuses on the provision of tests for the
|
2168
|
Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment
– Liu, Layland
- 1973
|
|
439
|
The rate monotonic scheduling algorithm-Exact characterization and average case behavior
– Lehoczky, Sha, et al.
- 1989
|
|
233
|
Applying new scheduling theory to static priority pre-emptive scheduling
– Audsley, Burns, et al.
- 1993
|
|
202
|
Finding response times in a real-time system
– Joseph, Pandya
- 1986
|
|
189
|
Fault Tolerance: Principles and Practice
– Lee, Anderson
- 1990
|
|
183
|
The N-version Approach to Fault-Tolerant Software
– Avizienis
- 1985
|
|
168
|
Enhancing aperiodic responsiveness in a hard real-time environment
– Lehoczky, Sha, et al.
- 1987
|
|
158
|
Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines
– Lehoczky
- 1990
|
|
142
|
An Optimal Algorithm for Scheduling Soft-Aperiodic Tasks in Fixed-Priority Preemptive Systems
– Lehoczky, Ramos-Thuel
- 1992
|
|
127
|
Exception Handling, Issues and a Proposed Notation
– Goodenough
- 1975
|
|
100
|
Computer Related Risks
– Neumann
|
|
97
|
On a Real-Time Scheduling Problem
– Dhall, Liu
- 1978
|
|
85
|
N-version programming: A fault-tolerance approach to reliability of software operation
– Chen, Avizienis
- 1978
|
|
85
|
Complexity Results for Multiprocessor Scheduling Under Resource Constraints
– Garey, Johnson
- 1975
|
|
83
|
Approximate Algorithms for Bin Packing - An Updated Survey
– Coffman, Garey, et al.
- 1985
|
|
74
|
Engineering and Analysis of Fixed Priority Schedulers
– Katcher, Arakawa, et al.
- 1993
|
|
69
|
A Fault Tolerant Scheduling Problem
– Liestman, Campbell
- 1986
|
|
68
|
On Scheduling Tasks with a Quick Recovery from Failure
– Krishna, Shin
- 1986
|
|
68
|
Software architecture for hard real-time applications: Cyclic executives vs. fixed priority executives
– Locke
- 1992
|
|
60
|
real-time scheduling: The deadline monotonic approach
– Hard
- 1991
|
|
52
|
Fixed priority scheduling of periodic tasks with arbitrary deadlines
– Lehoczky
- 1990
|
|
50
|
Distributed Execution of Recovery Blocks: An Approach for Uniform Treatment of Hardware and Software Faults in Real-Time Applications
– Kim, Welch
- 1989
|
|
48
|
Preemptive priority based scheduling: An appropriate engineering approach
– Burns
- 1994
|
|
46
|
Real-Time Systems and Programming Languages
– Burns, Wellings
- 1997
|
|
41
|
Software Safety: Why, What, and How
– Leveson
- 1986
|
|
41
|
Building a predictable avionics platform in ada: A case study. RTSS
– Locke, Vogel, et al.
- 1991
|
|
40
|
On the optimum checkpoint interval
– Gelenbe
- 1979
|
|
36
|
Fault Tolerant and Fault Testable Hardware Design
– Lala
- 1985
|
|
35
|
STRESS: A simulator for hard real-time systems
– Audsley, Burns, et al.
- 1994
|
|
30
|
Feasibility analysis of fault-tolerant real-time task sets
– Burns, Davis, et al.
- 1996
|
|
30
|
A survey of analytic models of rollback and recovery strategies
– Chandy
- 1975
|
|
28
|
Fault-Tolerance through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems
– Ghosh, Melhem, et al.
- 1997
|
|
27
|
Fixed priority scheduling theory for hard real-time systems,” Foundations of RealTime Computing: Scheduling and Resource Management
– Lehoczky, Sha, et al.
- 1991
|
|
25
|
Enhancing real-time schedules to tolerate transient faults
– Ghosh, Mosse
- 1995
|
|
24
|
ªThe Impact of an Ada Run-time System's Performance Characteristics on Scheduling Models,º
– Burns, Wellings
- 1993
|
|
23
|
Mechanisms for Enhancing the Flexibility and Utility of Hard Real-Time Systems
– Audsley, Davis, et al.
- 1994
|
|
23
|
A Program Structure for Error Detection and Recovery
– Horning, Lauer, et al.
- 1974
|
|
20
|
Guaranteeing Fault Tolerance through Scheduling in Real-Time Systems
– Ghosh
- 1996
|
|
19
|
Derivation and Calibration of a Transient Error Reliability Model
– Castillo, McConnel, et al.
- 1982
|
|
18
|
Static Timing Analysis and Program Proof
– Chapman
- 1995
|
|
16
|
Flexible scheduling for adaptable real-time systems
– Davis, Punnekkat, et al.
- 1995
|
|
16
|
On the Complexity of Fixed Priority Scheduling of Periodic
– Leung, Whitehead
- 1982
|
|
14
|
Adaptable Fault Tolerance for Real-Time Systems
– Bondavalli, Stankovic, et al.
- 1993
|
|
12
|
The STAR (self-testing and repairing) computer: An investigation on the theory and practice of fault-tolerant computer design
– Avizienis, Gilley, et al.
- 1971
|
|
12
|
Single event upset rates in space
– Campbell, McDonald, et al.
- 1992
|
|
11
|
Fault-tolerant Software
– Hecht, Hecht
- 1986
|
|
9
|
Concurrent fault detection in microprogrammed control units
– Iyengar, Kinney
- 1985
|
|
6
|
Concurrent Error-detection and Modular Fault-tolerance in a 32-bit Processing Core for Embedded Space Flight Applications
– Gaisler
- 1994
|
|
5
|
On exploiting spare capacity in hard real-time systems
– Davis
- 1995
|
|
4
|
Processor- and Memory- Based Checkpoint and Rollback Recovery
– Bowen, Pradhan
- 1993
|
