Recovery Algorithms: An Analysis

  • Igor SchagaevEmail author
  • Eugene Zouev
  • Kaegi Thomas


Discovered algorithm of modified linear recovery seems to be effective in terms of power of detection of fault and correct state of the system. At the same time, classic algorithms well presented in literature binary search and linear search can also be applied for the same purpose. Thus, we have to consider the recovery process itself and analyze which classic algorithms are applicable and fit the purpose of efficient recovery. We introduce and analyze three recovery algorithms that are able to ensure successful recovery by iteratively go through all stored recovery points.


  1. 1.
    Sogomonian E, Schagaev I (1988) Hardware and software fault tolerance of computer systems. Avtomatika i Telemekhanika 3–39Google Scholar
  2. 2.
    Schagaev I. Computing process recovery algorithms. Avtomat. Telemekh., (No. 4), 1989Google Scholar
  3. 3.
    Schagaev I (1990) Using software recovery methods for determining the type of hardware faults. Automat Remote Control 51(3)Google Scholar
  4. 4.
    Schagaev I. Algorithms of computation recovery. Automation and Remote Control, 7, 1986. 26, 36, 65, 122Google Scholar
  5. 5.
    Schagaev I (1987) Algorithms for restoring a computing process. Automat Remote Control 48(4), 26, 65, 122, 141, 149Google Scholar
  6. 6.
    Schagaev I (1986) Using data redundancy for program rollback. Automat Remote Control 47(7) Part 2, 1009–1016Google Scholar
  7. 7.
    Schagaev I, Viktorova V (1990) Comparative analysis of the efficiency of computation-process recovery algorithms. Automat Remote Control 51(1)Google Scholar
  8. 8.
    Koren I, Su SYH (1986) Analysis of a class of recovery procedures IEEE Trans Comput C-35(8) 703–712CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.IT-ACS LtdStevenageUK
  2. 2.Department of InformaticsTechnopolisInnopolis, KazanRussia

Personalised recommendations