Explore >> Select a destination
|
You are here 
|
speakerdeck.com | ||
| | | | |
martin.kleppmann.com
|
|
| | | | | ||
| | | | |
databeta.wordpress.com
|
|
| | | | | For folks who care about what's possible in distributed computing: Peter Alvaro and I wrote an introduction to the CALM Theorem and subsequent work that is now up on arXiv. The CALM Theorem formally characterizes the class of programs that can achieve distributed consistency without the use of coordination. I spent a good fraction of... | |
| | | | |
decomposition.al
|
|
| | | | | My research group has a new paper, "CRDT Emulation, Simulation, and Representation Independence", appearing at ICFP this year! This project was headed up by my PhD student Nathan Liittschwager, with help from another PhD student in my group, Jonathan Castello, and our collaborator Stelios Tsampas. You can read our preprint (warts and all, but soon to be improved, thanks to feedback from the ICFP reviewers) on arXiv, but here's a quick summary. Update (August 2025): The final version is now published in PACMPL, and there's an updated extended version on arXiv! | |
| | | | |
alexdebrie.com
|
|
| | | In this post, understand the different concepts of consistency as applied to distributed databases, as well as some issues with the conversation of consistency. | ||
