Abstract
We have defined a facility (transactions) which clients can use to perform complex updates to distributed data in a manner which maintains consistency in the presence of system crashes and concurrency. We have seen that transactions can be implemented with only a small amount of communication among servers. This communication is proportional to the number of servers involved in a transaction, rather than the size of the update. We have described the algorithm through a series of abstractions, together with informal correctness arguments.
This work was done jointly with Howard Sturgis.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lampson, B.W. (1981). Chapter 11. Atomic transactions. In: Davies, D.W., et al. Distributed Systems — Architecture and Implementation. Lecture Notes in Computer Science, vol 105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10571-9_11
Download citation
DOI: https://doi.org/10.1007/3-540-10571-9_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10571-8
Online ISBN: 978-3-540-69983-5
eBook Packages: Springer Book Archive