Specification and implementation of resilient, atomic data types
- 1 June 1983
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
A major issue in many applications is how to preserve the consistency of data in the presence of concurrency and hardware failures. We suggest addressing this problem by implementing applications in terms of abstract data types with two properties: Their objects are atomic (they provide serializability and recoverability for activities using them) and resilient (they survive hardware failures with acceptably high probability). We define what it means for abstract data types to be atomic and resilient. We also discuss issues that arise in implementing such types, and describe a particular linguistic mechanism provided in the Argus programming language.Keywords
This publication has 19 references indexed in Scilit:
- Guardians and Actions: Linguistic Support for Robust, Distributed ProgramsACM Transactions on Programming Languages and Systems, 1983
- On optimistic methods for concurrency controlACM Transactions on Database Systems, 1981
- The Recovery Manager of the System R Database ManagerACM Computing Surveys, 1981
- Issues in the design and use of a distributed file systemACM SIGOPS Operating Systems Review, 1980
- Experience with processes and monitors in MesaCommunications of the ACM, 1980
- The serializability of concurrent database updatesJournal of the ACM, 1979
- Abstract data types and software validationCommunications of the ACM, 1978
- Abstraction mechanisms in CLUCommunications of the ACM, 1977
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976
- MonitorsCommunications of the ACM, 1974