Compare-and-Swap: The Atomic Primitive Behind Lock-Free Programming
Compare-and-swap gave processors an atomic conditional update primitive powerful enough to build lock-free algorithms and, in theory, solve consensus for any number of threads.
Research-led essays, new evidence, arguments, interviews and artifact studies from a history that is still compiling. Every seeded essay ships with inline citations and a Works Cited record.
Compare-and-swap gave processors an atomic conditional update primitive powerful enough to build lock-free algorithms and, in theory, solve consensus for any number of threads.
The MESI family of cache-coherence protocols let multiprocessors keep private copies of shared memory while preserving the illusion that processors still agree on the values of shared cache lines.
Futures and promises made asynchronous computation easier to compose by giving an unfinished result a value-like placeholder that programs could pass around before the computation completed.
The Cray-1 combined vector registers, deep pipelining, fast semiconductor memory and unusually dense physical packaging into an iconic 1970s supercomputer optimized for scientific workloads.
Leslie Lamport's 1974 bakery algorithm showed that mutual exclusion could be achieved using ordinary shared reads and writes, even under surprisingly weak assumptions about overlapping memory operations.
Michael Flynn's taxonomy gave computer architects a durable vocabulary—SISD, SIMD, MISD and MIMD—for describing how instruction streams and data streams are organized.
Gene Amdahl's 1967 argument showed that speeding up only the parallel part of a workload leaves a stubborn serial remainder, creating a mathematical ceiling on strong-scaling speedup.
Kubernetes translated lessons from Google's Borg and Omega lineage into an open, declarative container orchestration system whose community governance helped make it a portable cloud infrastructure standard.
Kafka transformed a partitioned, retained append-only log into a high-throughput shared data backbone, allowing producers and many independent consumers to exchange and replay event streams.
ZooKeeper turned leader election, membership, configuration and synchronization into reusable patterns built on a small replicated namespace with ordering guarantees, sessions and watches.
Amazon S3 turned highly scalable object storage into an on-demand web service, separating durable data from owned hardware and making capacity, durability and consistency part of a cloud API contract.
Google's Chubby wrapped consensus in a filesystem-like service for locks, leader election and small critical metadata, making coordination reusable across systems such as GFS and Bigtable.