Issue No. 06 - June (1996 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.506695
<p><b>Abstract</b>—In this paper we propose a new approach for implementing rollback-recovery in a distributed computing system. A concept of <it>logical ring</it> is introduced for the maintenance of information required for consistent recovery from a system crash. Message processing order of a process is kept by all other processes on its logical ring. Transmission of data messages are accompanied by the circulation of the associated order messages on the ring. The sizes of the order messages are small. In addition, redundant transmission of order information is avoided, thereby reducing the communication overhead incurred during failure-free operation. Furthermore, updating of the order information and garbage collection task are simplified in the proposed mechanism. Our approach does not require information about message processing order be written to stable storage; in fact, the time-consuming operations of saving information in stable storage are confined to the checkpointing activities. When failures occur, a surviving process need roll back only if some preceding order information is totally lost, which is relatively unlikely considering the ever growing speed of communication networks. It is shown that a system can recover correctly as long as there exists at least one surviving process.</p>
Checkpoint, crash recovery, distributed computing systems, fault tolerance, logical ring, rollback.
Ge-Ming Chiu, Cheng-Ru Young, "Efficient Rollback-Recovery Technique in Distributed Computing Systems", IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 565-577, June 1996, doi:10.1109/71.506695