10.7 Summary
• For recovery, we presented the modified linear recovery algorithm, an algorithm
that allows the determination of the fault type and is able to find the last correct
recovery point, even in the case of latent faults. If two subsequent faults occur,
the modified linear algorithm does still work.
• We compared the linear modified algorithm with two other algorithms (linear
and dichotomous) of the same family. All mentioned algorithms differ in the
way the recursive recovery steps are performed.
• It was shown that the modified linear recovery algorithm has fastest recovery
time.
• Above all, it was shown that the modified linear recovery efficiency is substantially higher than two classic algorithms mentioned; modified linear recovery algorithm does not use any model or knowledge about the type of
hardware fault, making it unique in terms of applicability.
References
1. Sogomonian E, Schagaev I (1988) Hardware and software fault tolerance of computer systems.
Avtomatika i Telemekhanika 3–39
2. Schagaev I. Computing process recovery algorithms. Avtomat. Telemekh., (No. 4), 1989
3. Schagaev I (1990) Using software recovery methods for determining the type of hardware
faults. Automat Remote Control 51(3)
4. Schagaev I. Algorithms of computation recovery. Automation and Remote Control, 7, 1986.
26, 36, 65, 122
5. Schagaev I (1987) Algorithms for restoring a computing process. Automat Remote Control 48
(4), 26, 65, 122, 141, 149
6. Schagaev I (1986) Using data redundancy for program rollback. Automat Remote Control 47
(7) Part 2, 1009–1016
7. Schagaev I, Viktorova V (1990) Comparative analysis of the efficiency of computation-process
recovery algorithms. Automat Remote Control 51(1)
8. Koren I, Su SYH (1986) Analysis of a class of recovery procedures IEEE Trans Comput C-35
(8) 703–712
164
10 Recovery Algorithms: An Analysis
• For recovery, we presented the modified linear recovery algorithm, an algorithm
that allows the determination of the fault type and is able to find the last correct
recovery point, even in the case of latent faults. If two subsequent faults occur,
the modified linear algorithm does still work.
• We compared the linear modified algorithm with two other algorithms (linear
and dichotomous) of the same family. All mentioned algorithms differ in the
way the recursive recovery steps are performed.
• It was shown that the modified linear recovery algorithm has fastest recovery
time.
• Above all, it was shown that the modified linear recovery efficiency is substantially higher than two classic algorithms mentioned; modified linear recovery algorithm does not use any model or knowledge about the type of
hardware fault, making it unique in terms of applicability.
References
1. Sogomonian E, Schagaev I (1988) Hardware and software fault tolerance of computer systems.
Avtomatika i Telemekhanika 3–39
2. Schagaev I. Computing process recovery algorithms. Avtomat. Telemekh., (No. 4), 1989
3. Schagaev I (1990) Using software recovery methods for determining the type of hardware
faults. Automat Remote Control 51(3)
4. Schagaev I. Algorithms of computation recovery. Automation and Remote Control, 7, 1986.
26, 36, 65, 122
5. Schagaev I (1987) Algorithms for restoring a computing process. Automat Remote Control 48
(4), 26, 65, 122, 141, 149
6. Schagaev I (1986) Using data redundancy for program rollback. Automat Remote Control 47
(7) Part 2, 1009–1016
7. Schagaev I, Viktorova V (1990) Comparative analysis of the efficiency of computation-process
recovery algorithms. Automat Remote Control 51(1)
8. Koren I, Su SYH (1986) Analysis of a class of recovery procedures IEEE Trans Comput C-35
(8) 703–712
164
10 Recovery Algorithms: An Analysis