Tag: distributed-systems

Chord turned decentralized lookup into a compact ring of identifiers and logarithmic routing tables, helping establish the distributed hash table as a reusable peer-to-peer systems abstraction.

ZooKeeper turned leader election, membership, configuration and synchronization into reusable patterns built on a small replicated namespace with ordering guarantees, sessions and watches.

Remote Procedure Call replaced much hand-written message exchange with interface-defined calls, generated stubs and binding, while forcing programmers to confront the failures that distinguish a network call from a local one.

TLA+ combines state-transition modeling, temporal logic and model checking so engineers can find concurrency and distributed-system design errors before implementation.

The actor model reframed concurrent computation around independent entities that receive messages, change behavior and send messages rather than sharing one call stack.

Leslie Lamport's 1978 work showed that distributed programs can reason about causal order without pretending every machine shares a perfectly synchronized physical clock, establishing logical clocks and the happened-before relation as foundational distributed-systems abstractions.

Amazon Dynamo treated machine and network failures as normal, combining consistent hashing, replication, quorum techniques and version reconciliation to keep key-value services available.