The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Flexible update propagation for weakly consistent replication
Open accessAbstract
Bayou's anti-entropy protocol for update propagation between weakly consistent storage replicas is based on pair-wise communication, the propagation of write operations, and a set of ordering and closure.constraints on the propagation of the writes.The simplicity of the design makes the protocol very flexible, thereby providing support for diverse networking environments and usage scenarios.It accommodates a variety of policies for when and where to propagate updates.It operates over diverse network topologies, including low-bandwidth links.It is incremental.It enables replica convergence, and updates can be propagated using floppy disks and similar transportable media.Moreover, the protocol handles replica creation and retirement in a light-weight manner.Each of these features is enabled by only one or two of the protocol's design choices, and can be independently incorporated in other systems.This paper presents the anti-entropy protocol in detail, describing the design decisions and resulting features.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Self-citationDisconnected operation in the Coda File System
Kistler, J. J., & Satyanarayanan, M. (1992) · ACM Transactions on Computer Systems · doi:10.1145/146941.146942 · Cited by 1,065
The dangers of replication and a solution
Gray, J., Helland, P., O'Neil, P., & Shasha, D. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233330 · Cited by 1,019
Managing update conflicts in Bayou, a weakly connected replicated storage system
Terry, D. B., Theimer, M. M., Petersen, K., Demers, A. J., Spreitzer, M. J., & Hauser, C. H. (1995) · Proceedings of the fifteenth ACM symposium on Operating systems principles - SOSP '95 · doi:10.1145/224056.224070 · Cited by 815
Self-citationBirrell, A. D., Levin, R., Schroeder, M. D., & Needham, R. M. (1982) · Communications of the ACM · doi:10.1145/358468.358487 · Cited by 440
Session guarantees for weakly consistent replicated data
Terry, D., Demers, A. J., Petersen, K., Spreitzer, M., Theimer, M. M., & Welch, B. B. (2002) · International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1994.331722 · Cited by 430
Self-citationProviding high availability using lazy replication
Ladin, R., Liskov, B. H., Shrira, L., & Ghemawat, S. (1992) · ACM Transactions on Computer Systems · doi:10.1145/138873.138877 · Cited by 383
Rover: a toolkit for mobile information access
Joseph, A. D., de Lespinasse, A. F., Tauber, J. A., Gifford, D. K., & Kaashoek, M. F. (1995) · Proceedings of the fifteenth ACM symposium on Operating systems principles - SOSP '95 · doi:10.1145/224056.224069 · Cited by 253
The clearinghouse: a decentralized agent for locating named objects in a distributed environment
Oppen, D. C., & Dalal, Y. K. (1983) · ACM Transactions on Information Systems · doi:10.1145/357436.357439 · Cited by 179
Efficient solutions to the replicated log and dictionary problems
Wuu, G. T. J., & Bernstein, A. J. (1984) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/800222.806750 · Cited by 156
Replicated document management in a group communication system
Kawell, L., Beckhardt, S., Halvorsen, T., Ozzie, R., & Greif, I. (1988) · ACM Conference on Computer Supported Cooperative Work (CSCW) · doi:10.1145/62266.1024798 · Cited by 136
Discarding Obsolete Information in a Replicated Database System
Sarin, S. K., & Lynch, N. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.232564 · Cited by 69
A WEAK-CONSISTENCY ARCHITECTURE FOR DISTRIBUTED INFORMATION SERVICES
Golding, R. A. (1992) · Cited by 62
Cited by
PNUTS: Yahoo!'s hosted data serving platform
Cooper, B. F., Ramakrishnan, R., Srivastava, U., Silberstein, A., Bohannon, P., Jacobsen, H.-A., Puz, N., Weaver, D., & Yerneni, R. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454167 · Cited by 958
A low-bandwidth network file system
Muthitacharoen, A., Chen, B., & Mazières, D. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502052 · Cited by 784
Saito, Y., & Shapiro, M. (2005) · ACM Computing Surveys · doi:10.1145/1057977.1057980 · Cited by 739
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
Van Renesse, R., Birman, K. P., & Vogels, W. (2003) · ACM Transactions on Computer Systems · doi:10.1145/762483.762485 · Cited by 645
Metadata
- Authors
- Petersen, K., Spreitzer, M. J., Terry, D. B., Theimer, M. M., & Demers, A. J.
- Venue
- Proceedings of the sixteenth ACM symposium on Operating systems principles
- Publisher
- ACM
- Published
- 1997-10
- Pages
- 288-301
- OpenAlex
- W2001803004
- Cited by
- 475
- References
- 14
- FWCI
- 12.38
- Type
- conference paper
- Language
- en
- Open access
- gold
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
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.