DocumentCode
2490099
Title
A model for concurrent checkpointing and recovery using transactions
Author
Leu, Pei-jyun ; Bhargava, Bharat
Author_Institution
Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA
fYear
1989
fDate
5-9 Jun 1989
Firstpage
423
Lastpage
430
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
Keywords
concurrency control; database management systems; information retrieval; atomic operation; concurrent checkpointing; conflict; model; recovery; rollback; serializability; transactions; Algorithm design and analysis; Checkpointing; Computer bugs; Hardware; Interference; Merging; NASA; Protocols; System recovery; Transaction databases;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems, 1989., 9th International Conference on
Conference_Location
Newport Beach, CA
Print_ISBN
0-8186-1953-8
Type
conf
DOI
10.1109/ICDCS.1989.37973
Filename
37973
Link To Document