A simple deterministic algorithm for guaranteeing the forward progress of transactions
Name
leiserson_A simple deterministic.pdf
Size
129.67 KB
Format
Adobe PDF
Checksum (MD5)
ec2b3a8f96d002a24cb4159d1daa4a91
Author(s)
Leiserson, Charles E
Date Issued
December 2015
Journal
Information Systems
Publisher
Elsevier
Citation
Leiserson, Charles E. “A Simple Deterministic Algorithm for Guaranteeing the Forward Progress of Transactions.” Information Systems 57 (April 2016): 69–74 © 2016 Published by Elsevier Ltd
Version
Author's final manuscript
Abstract
This paper describes a remarkably simple deterministic (not probabilistic) contention-management algorithm for guaranteeing the forward progress of transactions - avoiding deadlocks, livelocks, and other anomalies. The transactions must be finite (no infinite loops), but on each restart, a transaction may access different shared-memory locations. The algorithm supports irrevocable transactions as long as the transaction satisfies a simple ordering constraint. In particular, a transaction that accesses only one shared-memory location is never aborted. The algorithm is suitable for both hardware and software transactional-memory systems. It also can be used in some contexts as a locking protocol for implementing transactions "by hand.".
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/J.IS.2015.10.013
