The DOI matches its Crossref record; 72 of the 72 references it cites were found in a registry or an index.
Optimistic replication
Open accessAbstract
Data replication is a key technology in distributed systems that enables higher availability and performance. This article surveys optimistic replication algorithms. They allow replica contents to diverge in the short term to support concurrent work practices and tolerate failures in low-quality communication links. The importance of such techniques is increasing as collaboration through wide-area and mobile networks becomes popular.Optimistic replication deploys algorithms not seen in traditional “pessimistic” systems. Instead of synchronous replica coordination, an optimistic algorithm propagates changes in the background, discovers conflicts after they happen, and reaches agreement on the final contents incrementally.We explore the solution space for optimistic replication algorithms. This article identifies key challenges facing optimistic replication systems---ordering operations, detecting and resolving conflicts, propagating changes efficiently, and bounding replica divergence---and provides a comprehensive survey of techniques developed for addressing these challenges.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
Linearizability: a correctness condition for concurrent objects
Herlihy, M. P., & Wing, J. M. (1990) · ACM Transactions on Programming Languages and Systems · doi:10.1145/78969.78972 · Cited by 3,176
Transaction Processing: Concepts and Techniques
Gray, J., & Reuter, A. (1992) · Cited by 3,000
Hypertext Transfer Protocol (HTTP)
(2003) · The Hacker's Handbook · doi:10.1201/9780203490044-20 · Cited by 2,824
Unreliable failure detectors for reliable distributed systems
Chandra, T. D., & Toueg, S. (1996) · Journal of the ACM · doi:10.1145/226643.226647 · Cited by 2,513
Fine-grained network time synchronization using reference broadcasts
Elson, J., Girod, L., & Estrin, D. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844143 · Cited by 2,396
Domain names - implementation and specification
Mockapetris, P. V. (1987) · doi:10.17487/rfc1035 · Cited by 1,698
Epidemic algorithms for replicated database maintenance
Demers, A., Greene, D., Hauser, C., Irish, W., & Larson, J. (1987) · Proceedings of the sixth annual ACM Symposium on Principles of distributed computing - PODC '87 · doi:10.1145/41840.41841 · Cited by 1,673
Weighted voting for replicated data
Gifford, D. K. (1979) · Proceedings of the seventh symposium on Operating systems principles - SOSP '79 · doi:10.1145/800215.806583 · Cited by 1,323
Cited by
Conflict-Free Replicated Data Types
Shapiro, M., Preguiça, N., Baquero, C., & Zawirski, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-24550-3_29 · Cited by 736
Self-citation
Metadata
- Authors
- Saito, Y., & Shapiro, M.
- Venue
- ACM Computing Surveys
- Published
- 2005-03
- Volume
- 37
- Issue
- 1
- Pages
- 42-81
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2295541535
- Cited by
- 739
- References
- 72
- FWCI
- 68.18
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimistic replication. https://app.cochat.ai/papers/10.1145/1057977.1057980
- The paper
- Saito, Y., & Shapiro, M. (2005). Optimistic replication. ACM Computing Surveys. https://doi.org/10.1145/1057977.1057980
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.