Concurrency: the Works of Leslie Lamport Editor: Dahlia Malkhi Publisher: Association for Computing Machinery New York NY United States ISBN:978-1-4503-7270-1 Pages: Appears In: ACM Books Bibliometrics Citation count Downloads (6 weeks) Downloads (12 months) Downloads (cumulative) Abstract
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.
research-article Preface pp xvii–xxhttps://doi.org/10.1145/3335772.3335773
This book is a collective work of many contributors. Leslie Lamport gave the world his work. Chapter authors, listed at the beginning of each chapter, volunteered their time and expert knowledge. Additional people contributed comments or portions of ...
1 1 Metrics Total Citations1 Total Downloads1 Last 12 Months1 Last 6 weeks1 Save to Binder Create a New Binder research-article Introduction Dahlia Malkhi, Idit Keidar pp 1–12https://doi.org/10.1145/3335772.3335774 0 2 Metrics Total Citations0 Total Downloads2 Last 12 Months2 Last 6 weeks1 Save to Binder Create a New Binder research-article The computer science of concurrency: the early years Leslie Lamport pp 13–26https://doi.org/10.1145/3335772.3335775 0 1 Metrics Total Citations0 Total Downloads1 Last 12 Months1 Last 6 weeks1 Save to Binder Create a New Binder research-article Shared memory and the Bakery algorithm Hagit Attiya, Jennifer L. Welch pp 27–46https://doi.org/10.1145/3335772.3335776 0 2 Metrics Total Citations0 Total Downloads2 Last 12 Months2 Last 6 weeks1 Save to Binder Create a New Binder research-article The notions of time and global state in a distributed system Karolos Antoniadis, Rachid Guerraoui pp 47–65https://doi.org/10.1145/3335772.3335777 0 1 Metrics Total Citations0 Total Downloads1 Last 12 Months1 Last 6 weeks1 Save to Binder Create a New Binder research-article Byzantine faults Christian Cachin pp 67–81https://doi.org/10.1145/3335772.3335778 0 Metrics Total Citations0 Save to Binder Create a New Binder research-article State machine replication with benign failures Rubbert van Renesse pp 83–102https://doi.org/10.1145/3335772.3335779 0 Metrics Total Citations0 Save to Binder Create a New Binder research-article Formal specification and verification Stephan Merz pp 103–129https://doi.org/10.1145/3335772.3335780 0 Metrics Total Citations0 Save to Binder Create a New Binder research-article Biography Roy Levin pp 131–170https://doi.org/10.1145/3335772.3335781 0 Metrics Total Citations0 Save to Binder Create a New Binder research-article A new solution of Dijkstra's concurrent programming problem Leslie Lamport pp 171–178https://doi.org/10.1145/3335772.3335782 0 Metrics Total Citations0 Save to Binder Create a New Binder research-article Time, clocks, and the ordering of events in a distributed system Leslie Lamport pp 179–196https://doi.org/10.1145/3335772.3335934 0 28 Metrics Total Citations0 Total Downloads28 Last 12 Months28 Last 6 weeks17 Save to Binder Create a New Binder research-article How to make a multiprocessor computer that correctly executes multiprocess programs Leslie Lamport pp 197–201https://doi.org/10.1145/3335772.3335935
Many large sequential computers execute operations in a different order than is specified by the program. A correct execution is achieved if the results produced are the same as would be produced by executing the program steps in order. For a ...
0 2 Metrics Total Citations0 Total Downloads2 Last 12 Months2 Last 6 weeks1 Save to Binder Create a New Binder research-article The Byzantine generals problem Leslie Lamport, Robert Shostak, Marshall Pease pp 203–226https://doi.org/10.1145/3335772.3335936 1 19 Metrics Total Citations1 Total Downloads19 Last 12 Months19 Last 6 weeks11 Save to Binder Create a New Binder research-article The mutual exclusion problem: part I---A theory of interprocess communication Leslie Lamport pp 227–245https://doi.org/10.1145/3335772.3335937
A novel formal theory of concurrent systems that does not assume any atomic operations is introduced. The execution of a concurrent program is modeled as an abstract set of operation executions with two temporal ordering relations: "precedence" and "can ...
0 1 Metrics Total Citations0 Total Downloads1 Last 12 Months1 Last 6 weeks1 Save to Binder Create a New Binder research-article The mutual exclusion problem: part II---Statement and solutions Leslie Lamport pp 247–276https://doi.org/10.1145/3335772.3335938
The theory developed in Part I is used to state the mutual exclusion problem and several additional fairness and failure-tolerance requirements. Four "distributed" N-process solutions are given, ranging from a solution requiring only one communication ...
To help support our community working remotely during COVID-19, we are making all work published by ACM in our Digital Library freely accessible through June 30, 2020. Learn more
About Cookies On This Site
[ comments ]