Eventually consistent

ABSTRACT

Building reliable distributed systems at a worldwide scale demands trade-offs between consistency and availability.

REFERENCES

• 1: Eric A. Brewer, Towards robust distributed systems (abstract), Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, p.7, July 16-19, 2000, Portland, Oregon, United States [doi>10.1145/343477.343502]
• 2: Steve Bourne, A Conversation with Bruce Lindsay, Queue, v.2 n.8, November 2004 [doi>10.1145/1036474.1036486]
• 3: Giuseppe DeCandia , Deniz Hastorun , Madan Jampani , Gunavardhan Kakulapati , Avinash Lakshman , Alex Pilchin , Swaminathan Sivasubramanian , Peter Vosshall , Werner Vogels, Dynamo: amazon's highly available key-value store, Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, October 14-17, 2007, Stevenson, Washington, USA
• 4: Seth Gilbert , Nancy Lynch, Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services, ACM SIGACT News, v.33 n.2, June 2002 [doi>10.1145/564585.564601]
• 5: Lindsay, B.G. et al. Notes on distributed databases. Distributed Data Bases. I.W. Draffan and F. Poole, Eds. Cambridge University Press, Cambridge, MA, 1980, 247--284. Also available as IBM Research Report RJ2517, San Jose, CA (July 1979).

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.1 PROCESSOR ARCHITECTURES
      C.1.4 Parallel Architectures

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.4 Systems