A Tight Upper Bound on the Benefits of Replication and Consistency Control Protocols
Summary: Tight upper bound: if a single‑copy availability is A (0<A<1) then no mutual‑exclusion/consistency protocol in the same failure-prone network can exceed sqrt(A). Bound is tight for A>0.25; computing A is #P‑complete, but a practical dynamic approximation for single‑copy placement is given. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Donald B. Johnson
- 2. Larry Raab
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,778 | Dynamic Voting | 1987 | SIGMOD | 0.00010581287 |
| 3,373 | Availability in Partitioned Replicated Databases (Extended Abstract) | 1986 | PODS | 7.167634e-05 |
| 6,935 | Enhancements To The Voting Algorithm | 1987 | VLDB | 4.8925595e-05 |
Previous
Page 1 / 1
Next