Abstract
The authors consider distributed algorithms that achieve transaction commitment at minimal communication cost but differ in the time it takes them to reach consensus. Based on this criterion, the authors define a `better than' partial ranking of minimal-communication-cost algorithms. They also discuss alternatives of a simple, minimal-communication-cost algorithm introduced previously, called TREE-COMMIT
| Original language | American English |
|---|---|
| Title of host publication | Data Engineering, 1988. Proceedings. Fourth International Conference on |
| Publisher | IEEE |
| State | Published - 1988 |