ACM Home Page
Please provide us with feedback. Feedback
Implementation of resilient, atomic data types
Full text PdfPdf (2.19 MB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 7 ,  Issue 2  (April 1985) table of contents
Lecture notes in computer science Vol. 174
Pages: 244 - 269  
Year of Publication: 1985
ISSN:0164-0925
Authors
William Weihl  MIT, Cambridge, MA
Barbara Liskov  MIT, Cambridge, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 24,   Citation Count: 34
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/3318.3319
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
BERNSTEIN, P., GOODMAN, N., AND LAI, M. Two-part proof schema for database concurrency control. In Proceedings of the 5th Berkeley Workshop on Distributed Data Management and Computer Networks, (Feb. 1981), 71-84.
 
3
BEST, E., AND RANDELL, B. A formal model of atomicity in asynchronous systems. Acta Inf. 16 (1981), 93-124.
 
4
DAHL, O.-J., ET AL. The Simula 67 common base language. Publication No. S-22, Norwegian Computing Center, Oslo, 1970.
5
 
6
DAVIES, C.T. Data processing spheres of control. IBM Syst. J. 17, 2 (1978), 179-198.
 
7
ELLIS, C. Concurrent search and insertion in 2-3 trees. Acta Inf. 14 (1980), 63-86.
8
9
 
10
11
12
 
13
14
15
16
17
 
18
19
20
 
21
22
 
23
24
25
 
26
27
28
29
30
 
31

CITED BY  34


REVIEW

"Edward A. Feustel : Reviewer"

I strongly recommend this paper as a tutorial and exposition of an area of current language research: user defined atomic data types. The purpose of the paper is to explain how resilient, atomic data types which the user needs may be implemented  more...

Collaborative Colleagues:
William Weihl: colleagues
Barbara Liskov: colleagues