distributed-systems

Almost every distributed database you touch today inherited something from a single 2007 SOSP paper. Cassandra is essentially its open-source descendant; Riak, Voldemort, and a decade of “eventually consistent” architecture trace back to the same document. This Papers We Love Tokyo session — the chapter’s inaugural talk, presented by Corrina Sivak — is a rare thing: a walkthrough by someone reading it as a working engineer rather than as an authority, complete with audience interruptions, honest “this might be a gap in my understanding,” and a genuinely useful comparison of what the paper described versus what AWS actually ships today....

Weekly Paper Notes — one of the top picks from the 2026-08-01 CS paper digest. Area: Systems / Networking. Authors: Evyatar Cohen, Jose Yallouz, Mark Silberstein, Isaac Keslassy (Technion); Alexander Shpiner (NVIDIA); Sylvia Ratnasamy, Isaac Keslassy (UC Berkeley) arXiv: 2607.26340 · PDF TL;DR Mixture-of-Experts models route each token to a small subset of experts, which turns every MoE layer into a highly skewed all-to-all communication phase across the GPU fabric....

Weekly Paper Notes — one of the top picks from the 2026-08-01 CS paper digest. Area: Operating Systems / Formal Methods. Authors: Qian Cheng, Ruize Tang, Yu Huang (Nanjing University); Saad Mohammad Rafid Pial, Yiming Su, Tianyin Xu (University of Illinois Urbana-Champaign); Emilie Ma, Finn Hackett, Ivan Beschastnikh (University of British Columbia) arXiv: 2607.25333 · PDF · Code TL;DR Formal verification of real systems has always been bottlenecked by the same thing: writing a good TLA+ specification takes a domain expert months, and the specification immediately begins drifting away from the code it describes....

Weekly Paper Notes — 🔁 Seminal Paper of the Week for the 2026-07-25 CS paper digest. Area: Distributed Computing. Authors: Leslie Lamport, Robert Shostak, Marshall Pease (SRI International) Venue: ACM Transactions on Programming Languages and Systems, Vol. 4, No. 3, July 1982, pp. 382–401. DOI: 10.1145/357172.357176 · PDF (SRI copy) Why the paper still matters Almost every distributed system in production today — Spanner, etcd, ZooKeeper, Kafka, every blockchain, every consensus protocol with a Greek letter in its name — is a descendant of the impossibility and possibility results in this 20-page paper....

arXiv: 2607.13276 · PDF: 2607.13276.pdf Authors: Marc Brooker, Marc Bowes, et al. (Amazon Web Services) TL;DR Aurora DSQL is AWS’s new serverless, PostgreSQL-compatible OLTP database designed for multi-region active-active writes. The architecture disaggregates compute (Firecracker MicroVMs running stateless SQL), storage, and transaction coordination into independent horizontally-scalable services. It uses MVCC with precision timestamps for coordination-free reads and optimistic concurrency control for writes, deferring all coordination to commit time via distributed adjudicators and a Journal replication tier....

Original: Leslie Lamport, Paxos Made Simple, ACM SIGACT News 32(4), December 2001. Canonical PDF: lamport.azurewebsites.net/pubs/paxos-simple.pdf Predecessor: The Part-Time Parliament, ACM TOCS 16(2), 1998 (the “island of Paxos” allegory that nobody could read). Why “made simple” Lamport originally described his consensus algorithm in 1998 in The Part-Time Parliament, a paper framed as archaeological reconstruction of the parliamentary procedures of an ancient Greek island. It was a joke. It was also, by broad consensus (pun deliberate), unreadable — reviewers hated it, adoption was near zero for years, and even engineers who wanted to build on it complained they couldn’t....

Weekly Paper Notes — Seminal Paper of the Week for the 2026-07-11 CS paper digest. Area: Distributed Computing / Coordination. Author: Mike Burrows (Google) Venue: OSDI ‘06 — The Chubby lock service for loosely-coupled distributed systems Canonical link: OSDI ‘06 proceedings · PDF Why the paper still matters Twenty years after publication, Chubby is the paper you can point at to explain almost every coordination system in the modern datacenter....

arXiv: 2607.02275 · PDF: pdf · Published: 2026-07-02 TL;DR Cadence is a Byzantine fault-tolerant consensus protocol that finalizes blocks at arbitrarily low block intervals by running each slot as an independent consensus instance — no slot waits for its predecessor to finish or propagate. It also drops the single-leader model in favor of multiple concurrent proposers (MCP) per slot, giving short-term censorship resistance and “hiding” (a proposer can’t craft its proposal in reaction to others’)....

Paper: Spanner: Google’s Globally-Distributed Database, Corbett et al., OSDI 2012. Canonical URL: research.google/pubs/pub39966 Every week we spotlight a foundational paper that still shapes how systems are built. This week — as the digest surfaces new BFT consensus (Cadence) and NVM storage (FlintKV) work — we rotate to databases and revisit the paper that arguably did the most to reset the industry’s assumptions about what a distributed OLTP system can offer: Spanner....

This week’s Classic of the Week is Pat Helland’s 2017 Kafka Summit keynote — a 20-minute tour that maps five great physicists onto the laws of distributed systems. It’s the rare classic talk that you can hand to a junior engineer to teach them what “eventual” really means, and to a senior engineer to remind them why their replication protocol keeps surprising them in production. Helland has been building distributed systems since 1978 (Tandem, Microsoft, Amazon, Salesforce)....