Asymmetric Linearizable Local Reads
Summary: Shows existing linearizable local-read algorithms incur worst-case read latency ≥ network relative diameter minus the known min message delay; proves this limitation. Introduces two algorithms exploiting asymmetric message delays to give processes near the leader/center worst-case reads below the relative diameter, with up to 50× reduction in experiments. (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. Myles Thiessen
- 2. Guy Khazma
- 3. Sam Toueg
- 4. Eyal de Lara
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 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 189 | Megastore: Providing Scalable, Highly Available Storage for Interactive Services | 2011 | CIDR | 0.00035925334 |
| 3,739 | Harmonia: Near-Linear Scalability for Replicated Storage with In-Network Conflict Detection | 2020 | VLDB | 6.8031881e-05 |
| 4,153 | Enabling the Next Generation of Multi-Region Applications with CockroachDB | 2022 | SIGMOD | 6.4045807e-05 |
| 7,493 | Nezha: Deployable and High-Performance Consensus Using Synchronized Clocks | 2023 | VLDB | 4.7180617e-05 |
Previous
Page 1 / 1
Next