Abstract
In a distributed computer network dynamic redundance can be used to improve system reliability. After detection of a node or module failure processing is taken over by a backup task located on another computer of the network. Before resumption of processing a prior system state has to be restored. Thereby the interactions of tasks have to be considered. In order to accelerate the restoration procedure it is important that each task can determine the extent of backtracking and the restart moment only on the basis of informations about its own interactions. The known “Chase Protocol” has been adopted to control the restoration process. Thereby it has shown, that in distinct error situations a task local decision about recovery points is only possible, if all informations about interactions have been saved. Finally the problems are discussed, which restrict the use of a backward recovery technique in the context of process control
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
