Real-time scheduling in a generic fault-tolerant architecture
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 390-398
- https://doi.org/10.1109/real.1998.739772
Abstract
Previous ultra-dependable real-time computing architectures have been specialised to meet the requirements of a particular application domain. Over the last two years, a consortium of European companies and academic institutions has been investigating the design and development of a Generic Upgradable Architecture for Real-time Dependable Systems (GUARDS). The architecture aims to be tolerant of permanent and temporary, internal and external, physical faults and should provide confinement or tolerance of software design faults. GUARDS critical applications are intended to be replicated across the channels which provide the primary hardware fault containment regions. In this paper, we present our approach to real-time scheduling of the GUARDS architecture. We use an extended response-time analysis to predict the timing properties of replicated real-time transactions. Consideration is also given to the scheduling of the inter-channel communications network.Keywords
This publication has 19 references indexed in Scilit:
- Supporting multiple levels of criticalityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Architectural principles for safety-critical real-time applicationsProceedings of the IEEE, 1994
- Guaranteed task deadlines for fault-tolerant workloads with conditional branchesReal-Time Systems, 1991
- Fault-tolerant parallel processorJournal of Guidance, Control, and Dynamics, 1991
- A new fault-tolerant algorithm for clock synchronizationInformation and Computation, 1988
- The MAFT architecture for distributed fault toleranceIEEE Transactions on Computers, 1988
- A real-time tool set for the ARTS kernelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- On the minimal synchronism needed for distributed consensusJournal of the ACM, 1987
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982