Resilient Objects in Broadband Networks
IEEE Transactions on Software Engineering
Fault tolerant distributed Ada
IRTAW '88 Proceedings of the second international workshop on Real-time Ada issues
Fault tolerant distributed Ada
ACM SIGAda Ada Letters
Constructing replicated systems using processors with point-to-point communication links
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis
IEEE Transactions on Parallel and Distributed Systems
A New Fault-Tolerant Technique for Improving the Schedulability in Multiprocessor Real-time Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Efficient overloading techniques for primary-backup scheduling in real-time systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Modular redundancy in the form of replicated computations in a concurrent programming model consisting of communicating sequential processes is investigated. Some conditions are given which must always be verified to ensure correctness in the presence of nondeterminism. Then some implementations which satisfy the given conditions are proposed. This approach permits redundant systems to be robust with respect to failures in redundant processors, and also permits the use of software fault tolerance techniques such as N-version programming. The concurrent programming model which has been chosen is based on a set of active entities, i.e., processes, each running in a local protected environment; processes interact using message passing only.