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 |
| Language: | English |
| Published: |
Elsevier,
2018-04-23T16:54:56Z.
|
| Subjects: | |
| Online Access: | Get fulltext |