A simple deterministic algorithm for guaranteeing the forward progress of transactions
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 transacti...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
Elsevier
2018
|
| Online Access: | http://hdl.handle.net/1721.1/114871 https://orcid.org/0000-0001-6386-5552 |