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...

Full description

Bibliographic Details
Main Author: Leiserson, Charles E
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Published: Elsevier 2018
Online Access:http://hdl.handle.net/1721.1/114871
https://orcid.org/0000-0001-6386-5552

Similar Items