Article

Free access

Reliability mechanisms for ADAMS

Authors:

J. L. PfaltzAuthors Info & Claims

C³P: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2

Pages 1390 - 1397

https://doi.org/10.1145/63047.63095

Published: 03 January 1989 Publication History

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 transaction activity while constructing a transaction-consistent checkpoint on disk, without requiring the database quiesce. This property of non-interference is highly desirable 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.

References

[1]

Attar, R., Bemstein, P. A. and Goodman, N., Site Initialization, Recovery, and Backup in a Distributed Database System, IEEE Trans. on Software Engineering, November 1984, pp 645-650.

Digital Library

[2]

Chandy, K. M., Lamport, L., Distributed Snapshots: Determining Global States of Distributed Systems, A CM Trans. on Computer Systems, February 1985, pp 63-75.

Digital Library

[3]

Dadam, P. and Schlageter, G., Recovery in Distributed Databases Based on Non-synchronized Local Checkpoints, Information Processing 80, North-Holland Publishing Company, Amsterdam, 1980, pp 457-462.

[4]

Eswaran, K. P. et al, The Notion of Consistency and Predicate Locks in a Database System, Commun. of ACM, Nov. 1976, pp 624-633.

Digital Library

[5]

Fischer, M. J., Griffeth, N. D. and Lynch, N. A., Global States of a Distributed System, IEEE Trans. on Software Engineering, May 1982, pp 198-202.

Digital Library

[6]

Gelenbe, E., On the Optimum Check~int Interval, Journal of ACM, April 1979, pp 259-270.

Digital Library

[7]

Hammer, M. and Shipman, D., Reliability Mechanisms for SDD-I' A System for Distributed Databases, A CM Trans. on Database Systems, December 1980, pp 431-466.

Digital Library

[8]

Jouve, M., Reliability Aspects in a Distributed Database Management System, Proc. of AICA, 1977, pp 199-209.

[9]

Kuss, H., On Totally Ordering Checkpoints in Distributed Databases, A CM SIGMOD International Conference on Management of Data, 1982, pp 293-302.

Digital Library

[10]

Lamport, L., Time, Clocks and Ordering of Events in Distributed Systems, Commun. ACM, July 1978, pp 558-565.

Digital Library

[11]

McDermid, J., Checkpointing and Error Recovery in Distributed Systems, 2nd International Conference on Distributed Computing Systems, April 1981, pp 271-282.

[12]

Mohan, C., Strong, R., and Finkelstein, S., Method for Distributed Transaction Commit and Recovery Using Byzantine Agreement Within Clusters of Processors, 2nd ACM SIGACT/SIGOPS Symposium on Principles of Distributed Computing, August 1983.

Digital Library

[13]

Ricart, G. and Agrawala, A. K., An Optimal Algorithm for Mutual Exclusion in Computer Networks, Commun. of ACM, Jan. 1981, pp 9-17.

Digital Library

[14]

Ries, D., The Effect of Concurrency Control on The Performance of A Distributed Data Management System, 4th Berkeley Conference on Distributed Data Management and Computer Networks, Aug. 1979, pp 221-234.

[15]

Schlageter, G. and Dadam, P., Reconstruction of Consistent Global States in Distributed Databases, International Symposium on Distributed Databases, North-Holland Publishing Company, iNRIA, 1980, pp 191-200.

[16]

Shin, K. G., Lin, T.-H., Lee, Y.-H., Optimal Checkpointing of Real-Time Tasks, 5th Symposium on Reliability in Distributed Software and Database Systems, January 1986, pp 151-158.

[17]

Skeen, D., Nonblocking Commit Protocols, ACM SIGMOD International Conference on Managernent of Data, 1981, pp 133-142.

Digital Library

[18]

Son, S. H., On Multiversion Replication Control in Distributed Systems, Computer Systems Science and Engineering, Vol. 2, No. 2, April 1987, pp 76-84.

Digital Library

[19]

Son, S. H. and Agrawala, A., Practicality of Non-Interfering Checkpoints in Distributed Database Systems, IEEE Real-Time Systems Symposium, New Orleans, Louisiana, December 1986, pp 234-241.

[20]

Son, S. H. and Agrawala, A., An Algorithm for Database Reconstruction in Distributed Environments, 6th International Conference on Distributed Computing Systems, Cambridge, Massachusetts, May 1986, pp 532-539.

[21]

Son, S. H., "An Adaptive Checkpointing Scheme for Distributed Databases with Mixed Types of Transactions," Fourth International Conference on Data Engineering, Los Angeles, February 1988, pp 528-535.

Digital Library

Cited By

Fox G(1989)What have we learnt from using real parallel machines to solve real problems?Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 210.1145/63047.63048(897-955)Online publication date: 3-Jan-1989
https://dl.acm.org/doi/10.1145/63047.63048

Index Terms

Reliability mechanisms for ADAMS
1. Software and its engineering
  1. Software organization and properties
    1. Extra-functional properties
      1. Software fault tolerance
        Checkpoint / restart

Recommendations

Architecting for Reliability - Recovery Mechanisms
ISSRE '08: Proceedings of the 2008 19th International Symposium on Software Reliability Engineering

Telecommunications systems achieve high levels of reliability by implementing detection and recovery mechanisms with high coverage. With the trend towards the use of more COTS components in these systems the choices available for the systems detection ...
On reliability mechanisms in distributed database systems
Assessing the reliability impacts of software fault-tolerance mechanisms
ISSRE '96: Proceedings of the The Seventh International Symposium on Software Reliability Engineering

Telecommunications systems are characterized by highly stringent reliability requirements for system availability and defect rate. A combination of approaches is used to achieve high software reliability, namely, fault avoidance, fault removal and ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

C³P: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2

January 1989

1787 pages

ISBN:0897912780

DOI:10.1145/63047

Editor:
Geoffrey Fox
California Institute of Technology, Pasadena, CA

Copyright © 1989 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 January 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

Hypercube88

Sponsor:

SIGARCH

Hypercube88: Third Conference on Hypercube Concurrent Computers and Applications

California, Pasadena, USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
191
Total Downloads

Downloads (Last 12 months)40
Downloads (Last 6 weeks)10

Reflects downloads up to 29 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Fox G(1989)What have we learnt from using real parallel machines to solve real problems?Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 210.1145/63047.63048(897-955)Online publication date: 3-Jan-1989
https://dl.acm.org/doi/10.1145/63047.63048

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten