A model for concurrent checkpointing and recovery usingtransactions
Leu, P.-J.
Bhargava, B.
Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN;
This paper appears in: Distributed Computing Systems, 1989., 9th International Conference on
Publication Date: 5-9 Jun 1989
On page(s): 423-430
Meeting Date: 06/05/1989 - 06/09/1989
Location: Newport Beach, CA, USA
ISBN: 0-8186-1953-8
References Cited: 12
INSPEC Accession Number: 3472224
Digital Object Identifier: 10.1109/ICDCS.1989.37973
Current Version Published: 2002-08-06
Abstract
Concurrent checkpointing and recovery using a concurrent
transaction processing model which consists of four types of atomic
operation and five types of conflict is developed. Each
checkpoint/rollback transaction is executed by multiple processes in the
system. They can be executed concurrently. It is shown that the
consistency of recovery lines and rollback lines established by
checkpoint transactions and rollback transactions can be achieved by
enforcing serializability on the corresponding transactions. There are
two advantages in using a transaction model for concurrent checkpointing
and recovery: (1) it is easier to find algorithms to solve a transaction
processing problem; and (2) based on this model, related issues of the
two corresponding problems can be thought of uniformly. This model
clarifies the concepts of concurrent checkpointing and recovery, and
brings more ideas for designing algorithms
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
