Explore >> Select a destination
|
You are here 
|
nomad.foo | ||
| | | | |
mattweidner.com
|
|
| | | | | [AI summary] This text provides an in-depth exploration of CRDTs (Conflict-Free Replicated Data Types), covering various data structures and algorithms for managing concurrent data in distributed systems. It includes discussions on unique sets, state-based CRDTs, and optimized versions that avoid tombstones. The text also touches on different CRDT types, such as OR-sets and unique sets, and their implementations, along with their applications in collaborative applications. The content is part of a series of blog posts by Matthew Weidner, a PhD student at CMU, focusing on the theory and practice of CRDTs. | |
| | | | |
www.inkandswitch.com
|
|
| | | | | Collaboration on rich text is hard to model with plain-text approaches. We review the challenges and how to construct a CRDT for rich text. | |
| | | | |
josephg.com
|
|
| | | | | ||
| | | | |
blog.dtornow.com
|
|
| | | The CAP theorem is too simplistic and too widely misunderstood to be of much use for characterizing systems. Therefore I ask that we retire all references to the CAP theorem, stop talking about the CAP theorem, and put the poor thing to rest Martin Kleppmann In 2000, Eric Brewer introduced the CAP Conjecture during his keynote address Towards Robust Distributed Systems at the Principles of Distributed Computing conference. Brewer posited that a distributed system cannot achieve Consistency, Availability, and Partition Tolerance simultaneously. | ||
