Concurrency: The Works of Leslie Lamport

Front Cover
Dahlia Malkhi
Morgan & Claypool, Sep 16, 2019 - Computers - 365 pages

This book is a celebration of Leslie Lamport's work on concurrency, interwoven in four-and-a-half decades of an evolving industry: from the introduction of the first personal computer to an era when parallel and distributed multiprocessors are abundant.

His works lay formal foundations for concurrent computations executed by interconnected computers. Some of the algorithms have become standard engineering practice for fault tolerant distributed computing – distributed systems that continue to function correctly despite failures of individual components. He also developed a substantial body of work on the formal specification and verification of concurrent systems, and has contributed to the development of automated tools applying these methods.

Part I consists of technical chapters of the book and a biography. The technical chapters of this book present a retrospective on Lamport's original ideas from experts in the field. Through this lens, it portrays their long-lasting impact. The chapters cover timeless notions Lamport introduced: the Bakery algorithm, atomic shared registers and sequential consistency; causality and logical time; Byzantine Agreement; state machine replication and Paxos; temporal logic of actions (TLA). The professional biography tells of Lamport's career, providing the context in which his work arose and broke new grounds, and discusses LaTeX – perhaps Lamport’s most influential contribution outside the field of concurrency. This chapter gives a voice to the people behind the achievements, notably Lamport himself, and additionally the colleagues around him, who inspired, collaborated, and helped him drive worldwide impact. Part II consists of a selection of Leslie Lamport's most influential papers.

This book touches on a lifetime of contributions by Leslie Lamport to the field of concurrency and on the extensive influence he had on people working in the field. It will be of value to historians of science, and to researchers and students who work in the area of concurrency and who are interested to read about the work of one of the most influential researchers in this field.

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Introduction
1
The Early Years
13
PART I TECHNICAL PERSPECTIVES ON LAMPORTSWORK
27
1 Shared Memory and the Bakery Algorithm
29
2 The Notions of Time and Global State in a Distributed System
47
3 Byzantine Faults
67
4 State Machine Replication with Benign Failures
83
5 Formal Specification and Verification
103
Clocks and the Ordering of Events in a Distributed System
179
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
197
The Byzantine Generals Problem
203
Part IA Theory of Interprocess Communication
227
Part IIStatement and Solutions
247
The PartTime Parliament
277
References
319
Index
335

6 Biography
131
PART II SELECTED PAPERS
171
A New Solution of Dijkstras Concurrent Programming Problem
173
Biographies
343
Copyright

Other editions - View all

Common terms and phrases

About the author (2019)

Dahlia Malkhi received her Ph.D., an M.Sc. and a B.Sc. in computer science from the Hebrew University of Jerusalem. She is currently a lead researcher at Calibra. She is an ACM fellow (2011), serves on the Simons Institute Advisory Board, on the MIT Cryptocurrency Journal Advisory Board, and on the editorial boards of the Distributed Computing Journal. Her research career spans between industrial research and academia: 2014–2019, founding member and principal researcher at VMware Research; 2004–2014, principal researcher at Microsoft Research, Silicon Valley; 1999–2007, associate professor at the Hebrew University of Jerusalem; 1995–1999, senior researcher, AT&T Labs-Research, New Jersey. She has research interest in applied and foundational aspects of reliability and security in distributed systems.

Bibliographic information