University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Reasoning about Eventual Consistency

Reasoning about Eventual Consistency

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

Modern databases underlying large-scale Internet services guarantee immediate availability and tolerate network partitions at the expense of providing only weak forms of consistency, commonly dubbed eventual consistency. Even though the folklore notion of eventual consistency is very weak, in reality, the semantics and programming interfaces of systems implementing it can be very subtle. Thus, such systems can resolve conflicting updates using complex protocols, called replicated data types, and can allow varying kinds of anomalous behaviour.

So far the semantics provided by eventually consistent systems has been poorly understood. I will present a framework for its formal specification that addresses this problem by generalising weak shared-memory models to arbitrary replicated data types. I will then describe our ongoing effort to develop effective reasoning principles for eventually consistent systems.

This is joint work with Sebastian Burckhardt (Microsoft Research), Hongseok Yang (University of Oxford) and Marek Zawirski (UPMC & INRIA ). Part of it will appear in POPL ’14.

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity