Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
To appear in Proceedings of the 23rd ACM Symposium on Operating Systems Principles (SOSP'11) Don't Settle for Eventual
 

Summary: To appear in Proceedings of the 23rd ACM Symposium on Operating Systems Principles (SOSP'11)
Don't Settle for Eventual:
Scalable Causal Consistency for Wide-Area Storage with COPS
Wyatt Lloyd , Michael J. Freedman , Michael Kaminsky
, and David G. Andersen
Princeton University,
Intel Labs,
Carnegie Mellon University
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.
We present the design and implementation of COPS, a key-value
store that delivers this consistency model across the wide-area. A

  

Source: Andersen, Dave - School of Computer Science, Carnegie Mellon University
Carnegie Mellon University, School of Computer Science, Informedia Project
Singh, Jaswinder Pal - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences