Consistency as Knowledge
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Gemma Gordon.
Consistency conditions for distributed systems (such as
eventual consistency) are often formalised by specifying
happens-before relationships between read-and write events that must
be preserved by the system.
In this talk, I will argue that a natural way to reason about
these conditions arises from thinking about what individual nodes know about a given computation.
For this purpose, I will present how eventual consistency can be
formalised in term of knowledge.
This talk is part of the Computer Laboratory NetOS Group Talklets series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|