Analysis of a Class of Recovery Procedures
- 1 August 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-35 (8) , 703-712
- https://doi.org/10.1109/tc.1986.1676821
Abstract
Recovery procedures involving time redundancy in the form of instruction retries and program rollbacks have proved to be very effective against transient failures in computer systems. A class of such recovery procedures is presented and analyzed here, and the parameters of each procedure are determined so that the system's operation is optimized. These procedures are then compared in order to select the most appropriate one for given system parameters.Keywords
This publication has 10 references indexed in Scilit:
- On the Optimum Checkpoint Selection ProblemSIAM Journal on Computing, 1984
- Performance analysis of checkpointing strategiesACM Transactions on Computer Systems, 1984
- Reliability Analysis of N-Modular Redundancy Systems with Intermittent and Permanent FaultsIEEE Transactions on Computers, 1979
- On the Optimum Checkpoint IntervalJournal of the ACM, 1979
- A Continuous-Parameter Markov Model and Detection Procedures for Intermittent FaultsIEEE Transactions on Computers, 1978
- The Error Latency of a Fault in a Sequential Digital CircuitIEEE Transactions on Computers, 1976
- Analytic models for rollback and recovery strategies in data base systemsIEEE Transactions on Software Engineering, 1975
- A first order approximation to the optimum checkpoint intervalCommunications of the ACM, 1974
- The retryable processorPublished by Association for Computing Machinery (ACM) ,1972
- Recovery through programming system/360Published by Association for Computing Machinery (ACM) ,1971