Paper
1990
Linearizability: A Correctness Condition for Concurrent Objects
Maurice P. Herlihy & Jeannette M. Wing
Defines linearizability as each operation appearing to take effect instantaneously at some point between its call and return, giving concurrent objects a correctness condition as strong as sequential correctness.
Read itBefore you start
FreeAdvancedlink checked 17 Sept 2026
If this is the wrong level
Groundwork for
Works in the library that name this one as a prerequisite.
- Brewer's Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web ServicesSeth Gilbert & Nancy Lynch, 2002Proves Brewer's conjecture formally: under network partition a system must give up either consistency or availability.
- Chain Replication for Supporting High Throughput and AvailabilityRobbert van Renesse & Fred B. Schneider, 2004Arranges replicas in a chain so that strong consistency and high throughput stop being a trade-off.
Filed under Distributed Systems in Computer Science.