Concurrency

Contents
Preface
Photo and Text Credits
Introduction
The Computer Science of Concurrency: The Early Years
PART I. TECHNICAL PERSPECTIVES ON LAMPORT’SWORK
1. Shared Memory and the Bakery Algorithm
2. The Notions of Time and Global State in a Distributed System
3. Byzantine Faults
4. State Machine Replication with Benign Failures
5. Formal Specification and Verification
6. Biography
PART II. SELECTED PAPERS
A New Solution of Dijkstra’s Concurrent Programming Problem
Clocks, and the Ordering of Events in a Distributed System
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
The Byzantine Generals Problem
The Mutual Exclusion Problem: Part I—A Theory of Interprocess Communication
The Mutual Exclusion Problem: Part II—Statement and Solutions
The Part-Time Parliament
References
Index
Biographies
Blank Page
Blank Page