The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Don't settle for eventual: scalable causal consistency for wide-area storage with COPS
Abstract
Geo-replicated, distributed data stores that support complex online applications, such as social networks, must provide an "always-on" experience where operations always complete with low latency. Today's systems often sacrifice strong consistency to achieve these goals, exposing inconsistencies to their clients and necessitating complex application logic. In this paper, we identify and define a consistency model---causal consistency with convergent conflict handling, or causal+---that is the strongest achieved under these constraints.
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
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945450 · Cited by 4,984
(2007) · doi:10.1145/1294261.1294281 · Cited by 3,447 · cited 3×
“Multiple geographically distributed datacenters each have application clients that read and write state from a data store that is distributed across all of the datacenters.”
BackgroundMethodLinearizability: 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
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402967 · Cited by 3,175
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
Cassandra: a decentralized structured storage system
Lakshman, A., & Malik, P. (2010) · ACM SIGOPS Operating Systems Review · doi:10.1145/1773912.1773922 · Cited by 2,664
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
Lamport (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675439 · Cited by 2,519
VL2: a scalable and flexible data center network
Greenberg, A., Hamilton, J. R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D. A., Patel, P., & Sengupta, S. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592576 · Cited by 2,111
Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., & Lewin, D. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258660 · Cited by 1,981
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
Gilbert, S., & Lynch, N. (2002) · ACM SIGACT News · doi:10.1145/564585.564601 · Cited by 1,727
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · Proceedings of the ACM SIGCOMM 2008 conference on Data communication · doi:10.1145/1402958.1402967 · Cited by 1,679
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · Proceedings of the nineteenth ACM symposium on Operating systems principles · doi:10.1145/945445.945450 · Cited by 1,423
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
Disconnected 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
A Majority consensus approach to concurrency control for multiple copy databases
Thomas, R. H. (1979) · ACM Transactions on Database Systems · doi:10.1145/320071.320076 · Cited by 1,003
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
Towards robust distributed systems (abstract)
Brewer, E. A. (2000) · Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing · doi:10.1145/343477.343502 · Cited by 809
The Gamma database machine project
DeWitt, D. J., Ghandeharizadeh, S., Schneider, D. A., Bricker, A., Hsiao, H.-I., & Rasmussen, R. (1990) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.50905 · Cited by 668
Megastore: Providing Scalable, Highly Available Storage for Interactive Services
Baker, J. D., Bond, C. T., Corbett, J. C., Furman, J. J., Khorlin, A., Larson, J. A., Leon, J.-M., Li, Y., Lloyd, A., & Yushprakh, V. (2011) · Cited by 645
Exploiting virtual synchrony in distributed systems
Birman, K., & Joseph, T. (1987) · ACM SIGOPS Operating Systems Review · doi:10.1145/37499.37515 · Cited by 601
FAWN: a fast array of wimpy nodes
Andersen, D. G., Franklin, J., Kaminsky, M., Phanishayee, A., Tan, L., & Vasudevan, V. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629577 · Cited by 561
Self-citationCluster-based scalable network services
Fox, A., Gribble, S. D., Chawathe, Y., Brewer, E. A., & Gauthier, P. (1997) · Proceedings of the sixteenth ACM symposium on Operating systems principles · doi:10.1145/268998.266662 · Cited by 522
Chain replication for supporting high throughput and availability
van Renesse, R., & Schneider, F. B. (2004) · Operating Systems Design and Implementation · Cited by 495
Causal memory: definitions, implementation, and programming
Ahamad, M., Neiger, G., Burns, J. E., Kohli, P., & Hutto, P. W. (1995) · Distributed Computing · doi:10.1007/bf01784241 · Cited by 481
Flexible update propagation for weakly consistent replication
Petersen, K., Spreitzer, M. J., Terry, D. B., Theimer, M. M., & Demers, A. J. (1997) · Proceedings of the sixteenth ACM symposium on Operating systems principles · doi:10.1145/268998.266711 · Cited by 475
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
A principle for resilient sharing of distributed resources
Alsberg, P. A., & Day, J. (1976) · doi:10.5555/800253.807732 · Cited by 416
Transactional storage for geo-replicated systems
Sovran, Y., Power, R., Aguilera, M. K., & Li, J. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043592 · Cited by 390
Providing 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
Viewstamped replication: a general primary copy
Oki, B. M., & Liskov, B. H. (1988) · Proceedings of the seventh annual ACM Symposium on Principles of distributed computing - PODC '88 · doi:10.1145/62546.62549 · Cited by 380
Transaction management in the R* distributed database management system
Mohan, C., Lindsay, B., & Obermarck, R. (1986) · ACM Transactions on Database Systems · doi:10.1145/7239.7266 · Cited by 359
Detection of Mutual Inconsistency in Distributed Systems
Parker, D. S., Popek, G. J., Rudisin, G., Stoughton, A., Walker, B. J., Walton, E., Chow, J., Edwards, D., Kiser, S., & Kline, C. S. (1983) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1983.236733 · Cited by 356
Exploiting virtual synchrony in distributed systems
Birman, K., & Joseph, T. (1987) · Proceedings of the eleventh ACM Symposium on Operating systems principles - SOSP '87 · doi:10.1145/41457.37515 · Cited by 265
A quorum-consensus replication method for abstract data types
Herlihy, M. P. (1986) · ACM Transactions on Computer Systems · doi:10.1145/6306.6308 · Cited by 247
Understanding the limitations of causally and totally ordered communication
Cheriton, D. R., & Skeen, D. (1993) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/168619.168623 · Cited by 204
Flexible update propagation for weakly consistent replication
Petersen, K., Spreitzer, M. J., Terry, D. B., Theimer, M. M., & Demers, A. J. (1997) · ACM SIGOPS Operating Systems Review · doi:10.1145/269005.266711 · Cited by 71
Object storage on CRAQ: high-throughput chain replication for read-mostly workloads
Terrace, J., & Freedman, M. J. (2009) · Cited by 66
Self-citation
Cited by
Kambatla, K., Kollias, G., Kumar, V., & Grama, A. (2014) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2014.01.003 · Cited by 819
Transactional storage for geo-replicated systems
Sovran, Y., Power, R., Aguilera, M. K., & Li, J. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043592 · Cited by 390
Metadata
- Authors
- Lloyd, W., Freedman, M. J., Kaminsky, M., & Andersen, D. G.
- Venue
- Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
- Publisher
- ACM
- Published
- 2011-10-23
- Pages
- 401-416
- OpenAlex
- W2161730338
- Cited by
- 565
- References
- 38
- FWCI
- 39.13
- Type
- conference paper
- Language
- en
- Open access
- closed
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.