Abstract
The goal of checkpointing in database management systems is to save database states on a separate secure device so that the database can be recovered when errors and failures occur. This paper presents a non-interfering checkpointing mechanism being developed for ADAMS. Instead of waiting for a consistent state to occur, our checkpointing approach constructs a state that would result by completing the transactions that are in progress when the global checkpoint begins. The checkpointing algorithm is executed concurrently with transaclion activity while constructing a transaction-consistent checkpoint on disk, without requiring the database quiesce. This property of noninterference is highly de.sirable to real-time applications, where restricting transaction activity during the checkpointing operation is in many cases not feasible. Two main properties of this checkpointing algorithm are global consistency and reduced interference, both of which are crucial for achieving high availability.
Original language | English |
---|---|
Title of host publication | Proceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988 |
Editors | Geoffrey Fox |
Publisher | Association for Computing Machinery, Inc |
Pages | 1390-1397 |
Number of pages | 8 |
ISBN (Electronic) | 0897912780, 9780897912785 |
DOIs | |
State | Published - 3 Jan 1989 |
Event | 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988 - Pasadena, United States Duration: 19 Jan 1988 → 20 Jan 1988 |
Publication series
Name | Proceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications: Architecture, Software, Computer Systems, and General Issues, C3P 1988 |
---|---|
Volume | 2 |
Conference
Conference | 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988 |
---|---|
Country/Territory | United States |
City | Pasadena |
Period | 19/01/88 → 20/01/88 |
Bibliographical note
Publisher Copyright:© ACM 1988.