Aiyer, A., Alvisi, L. and Bazzi, R.A. On the availability of non-strict quorum systems. In Proceedings of the 19^th International Symposium on Distributed Computing, (2005), 48--62.

Digital Library

Google Scholar

[3]

Amazon Web Services. DynamoDB; http://aws.amazon.com/dynamodb/.

Google Scholar

[4]

Amazon Web Services. SimpleDB; http://aws.amazon.com/simpledb/.

Google Scholar

[5]

Anderson, E., Li, X., Shah, M.A., Tucek, J. and Wylie, J.J. What consistency does your key-value store actually provide? In Proceedings of the 6^th Usenix Workshop on Hot Topics in System Dependability, 2010.

Digital Library

Google Scholar

[6]

Bailis, P., Venkataraman, S., Franklin, M.J., Hellerstein, J.M. and Stoica, I. Probabilistically bounded staleness for practical partial quorums. In Proceedings of the VLDB Endowment 5, 8 (2012), 776--787.

Digital Library

Google Scholar

[7]

Bermbach, D., Sakr, S. and Zhao, L. Towards comprehensive measurement of consistency guarantees for cloud-hosted data storage services. In Proceedings of the 5^th TPC (Transaction Processing Performance Council) Technology Conference on Performance Evaluation and Benchmarking, 2013.

Google Scholar

[8]

Bermbach, D. and Tai, S. Eventual consistency: how soon is eventual? An evaluation of Amazon S3's consistency behavior. In Proceedings of the 6^th Workshop on Middleware for Service-oriented Computing, 2011.

Digital Library

Google Scholar

[9]

Brewer, E.A. Towards robust distributed systems (invited talk). In Proceedings of the 19^th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2000.

Digital Library

Google Scholar

[10]

Corbet, J.C., et al. Spanner: Google's globally distributed database. In Proceedings of the 10^th Usenix Conference on Operating Systems Design and Implementation, (2012), 251--264.

Digital Library

Google Scholar

[11]

Davidson, A., Rubinstein, A., Todi, A., Bailis, P. and Venkataraman, S. Adaptive hybrid quorums in practical settings, 2012; http://www.cs.berkeley.edu/~kubitron/courses/cs262a-F12/projects/reports/project12_report_ver2.pdf.

Google Scholar

[12]

Decandia, G., Hastorun, D., Jampani, M. et al. Dynamo: Amazon's highly available key-value store. In Proceedings of the 21^st ACM Symposium on Operating Systems Principles, 2007.

Digital Library

Google Scholar

[13]

Gibbons, P.B. and Korach, E. Testing shared memories. Society for Industrial and Applied Mathematics Journal on Computing 26, 4 (1997), 1208--1244.

Digital Library

Google Scholar

[14]

Golab, W., Hurwitz, J. and Li, X. On the k-atomicity-verification problem. In Proceedings of the 33^rd IEEE International Conference on Distributed Computing Systems, 2013.

Digital Library

Google Scholar

[15]

Golab, W., Li, X. and Shah and M.A. Analyzing consistency properties for fun and profit. In Proceedings of the 30^th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, (2011), 197--206.

Digital Library

Google Scholar

[16]

Golab, W., Rahman, M.R., AuYoung, A., Keeton, K. and Gupta, I. Client-centric benchmarking of eventual consistency for cloud storage systems. Manuscript under submission, 2013.

Google Scholar

[17]

Hamilton, J. The cost of latency; http://perspectives.mvdirona.com/2009/10/31/TheCostOfLatency.aspx.

Google Scholar

[18]

Herlihy, M. and Wing, J.M. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12, 3 (1990), 463--492.

Digital Library

Google Scholar

[19]

Hunt, P., Konar, M., Junqueira, F.P. and Reed, B. ZooKeeper: Wait-free coordination for Internet-scale systems. In Proceedings of the 2010 Usenix Annual Technical Conference, (2010), 11--25.

Digital Library

Google Scholar

[20]

Lakshman, A. and Malik, P. Cassandra: A decentralized structured storage system. ACM SIGOPS Operating Systems Review 44, 2 (2010), 35--40.

Digital Library

Google Scholar

[21]

Lamport, L. On interprocess communication. Part I: basic formalism; and Part II: algorithms. Distributed Computing 1, 2 (1986), 77--101.

Crossref

Google Scholar

[22]

Lloyd, W., Freedman, M.J., Kaminsky, M. and Andersen, D.G. Don't settle for eventual: Scalable causal consistency for wide-area storage with COPS. In Proceedings of the 23^rd ACM Symposium on Operating Systems Principles, (2011), 401--416.

Digital Library

Google Scholar

[23]

Patil, S., Polte, M., Ren, K. et al. YCSB++: benchmarking and performance debugging advanced features in scalable table stores. In Proceedings of the 2^nd ACM Symposium on Cloud Computing, (2011), 9:1--9:14.

Digital Library

Google Scholar

[24]

Rahman, M.R., Golab, W., AuYoung, A., Keeton, K. and Wylie, J.J. Toward a principled framework for benchmarking consistency. In Proceedings of the 8^th Usenix Workshop on Hot Topics in System Dependability, 2012

Digital Library

Google Scholar

[25]

Terry, D. 2013. Replicated data consistency explained through baseball. Communications of the ACM 56, 12 (Dec. 2013), 82--89.

Digital Library

Google Scholar

[26]

Terry, D., Petersen, K., Spreitzer, M. and Theimer, M. The case for non-transparent replication: examples from Bayou. IEEE Data Eng. Bulletin 21 (1998), 12--20.

Google Scholar

[27]

Terry, D.B., Prabhakaran, V., Kotla, R., Balakrishnan, M., Aguilera, M.K. and Abu-Libdeh, H. Consistency-based service-level agreements for cloud storage. In Proceedings of the 24^th ACM Symposium on Operating Systems Principles, 2013.

Digital Library

Google Scholar

[28]

Vogels, W. Eventually consistent. ACM Queue 6, 6 (2008), 14--19.

Digital Library

Google Scholar

[29]

Wada, H., Fekete, A., Zhao, L., Lee, K. and Liu, A. Data consistency properties and the trade-offs in commercial cloud storage: the consumers' perspective. In Proceedings of the 5^th Biennial Conference on Innovative Data Systems Research, 2011, 134--143.

Google Scholar

[30]

Zellag, K. and Kemme, B. How consistent is your cloud application? In Proceedings of the 3^rd ACM Symposium on Cloud Computing, (2012), 1--14.

Digital Library

Google Scholar

Cited By

View all

Alabdulkarim YAlmaymoni MGhandeharizadeh S(2019)Polygraph: A Plug-n-Play Framework to Quantify Application AnomaliesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2019.2939520(1-1)Online publication date: 2019
https://doi.org/10.1109/TKDE.2019.2939520
Attiya HEllen FMorrison A(2017)Limitations of Highly-Available Eventually-Consistent Data StoresIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2016.255666928:1(141-155)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1109/TPDS.2016.2556669
Goncalves RAlmeida PBaquero CFonte V(2017)DottedDB: Anti-Entropy without Merkle Trees, Deletes without Tombstones2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS.2017.28(194-203)Online publication date: Sep-2017
https://doi.org/10.1109/SRDS.2017.28
Show More Cited By

Index Terms

Eventually consistent: not what you were expecting?
1. General and reference
  1. Cross-computing tools and techniques
    1. Metrics
2. Information systems
  1. Information retrieval
  2. Information storage systems

Recommendations

Eventually consistent transactions
ESOP'12: Proceedings of the 21st European conference on Programming Languages and Systems

When distributed clients query or update shared data, eventual consistency can provide better availability than strong consistency models. However, programming and implementing such systems can be difficult unless we establish a reasonable consistency ...
Towards verifying eventually consistent applications
PaPEC '14: Proceedings of the First Workshop on Principles and Practice of Eventual Consistency

Modern cloud and distributed systems depend heavily on replication of large-scale databases to guarantee properties like high availability, scalability and fault tolerance. These replicas are maintained in geographically distant locations to be able to ...
Limitations of Highly-Available Eventually-Consistent Data Stores
PODC '15: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing

Modern replicated data stores aim to provide high availability, by immediately responding to client requests, often by implementing objects that expose concurrency. Such objects, for example, multi-valued registers (MVRs), do not have sequential ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Communications of the ACM Volume 57, Issue 3

March 2014

99 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/2566590

Editor:
Moshe Y. Vardi
Association for Computing Machinery, New York, NY

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 2014

Published in CACM Volume 57, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Popular
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
6,561
Total Downloads

Downloads (Last 12 months)366
Downloads (Last 6 weeks)87

Reflects downloads up to 16 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Alabdulkarim YAlmaymoni MGhandeharizadeh S(2019)Polygraph: A Plug-n-Play Framework to Quantify Application AnomaliesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2019.2939520(1-1)Online publication date: 2019
https://doi.org/10.1109/TKDE.2019.2939520
Attiya HEllen FMorrison A(2017)Limitations of Highly-Available Eventually-Consistent Data StoresIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2016.255666928:1(141-155)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1109/TPDS.2016.2556669
Goncalves RAlmeida PBaquero CFonte V(2017)DottedDB: Anti-Entropy without Merkle Trees, Deletes without Tombstones2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS.2017.28(194-203)Online publication date: Sep-2017
https://doi.org/10.1109/SRDS.2017.28
Pankowski T(2016)Lorq: A System for Replicated NoSQL Data Based on Consensus QuorumEvaluation of Novel Approaches to Software Engineering10.1007/978-3-319-30243-0_4(62-79)Online publication date: 2016
https://doi.org/10.1007/978-3-319-30243-0_4
Schoonjans ALagaisse BJoosen W(2015)Advanced monitoring and smart auto-scaling of NoSQL systemsProceedings of the Doctoral Symposium of the 16th International Middleware Conference10.1145/2843966.2843969(1-4)Online publication date: 7-Dec-2015
https://dl.acm.org/doi/10.1145/2843966.2843969
Decker HMuñoz-Escoí FMisra S(2015)Data Consistency: Toward a Terminological ClarificationComputational Science and Its Applications -- ICCSA 201510.1007/978-3-319-21413-9_15(206-220)Online publication date: 19-Jun-2015
https://doi.org/10.1007/978-3-319-21413-9_15
Pankowski T(2015)A Consensus Quorum Algorithm for Replicated NoSQL DataBeyond Databases, Architectures and Structures10.1007/978-3-319-18422-7_10(116-125)Online publication date: 2015
https://doi.org/10.1007/978-3-319-18422-7_10

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Eventually consistent transactions

Towards verifying eventually consistent applications

Limitations of Highly-Available Eventually-Consistent Data Stores

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Digital Edition

Magazine Site

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations