Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme

Switch Atlas

Pioneer

Leslie Lamport

Also Known As Leslie B. Lamport · Leslie Barry Lamport
Computer Systems Organization

Leslie Barry Lamport is an American computer scientist and mathematician best known for his seminal work in distributed systems and as the initial developer of the LaTeX document preparation system, writing its first manual. He won the 2013 Turing Award for imposing clear, well-defined coherence on the seemingly chaotic behavior of distributed computing systems, devising algorithms and formal modeling and verification protocols that improved the correctness, performance and reliability of real distributed systems. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Facts
Birth Year
1941 1
Birth Date
1941-02-07 2
Award
honorary doctorate 1
Award
Dijkstra Prize 1
Award
honorary doctorate of the Henri Poincaré University 1
Award
Turing Award 1
Award
ACM Fellow 1
Award
honorary doctor of the University of Rennes I 1
Award
IEEE Emanuel R. Piore Award 1
Award
honorary doctor of the École polytechnique fédérale de Lausanne 1
Award
IEEE John von Neumann Medal 1
Award
honorary doctor of the Christian Albrechts University of Kiel 1
Leslie Lamport
Filter Results2 entries

Byzantine Fault Tolerance

Leslie Lamport

Consensus Problem

Leslie Lamport
Connections

Associated With

Vector Clocks, Concepts

Vector clocks, introduced by Colin Fidge and Friedemann Mattern, directly generalize the logical clock concept Leslie Lamport introduced in his 1978 paper on ordering events in distributed systems.

Credited

Chandy-Lamport algorithm, Algorithms
Source Chandy-Lamport algorithm (Wikipedia)
Lamport timestamp, Algorithms
Source Lamport timestamp (Wikipedia)
Lamport's bakery algorithm, Algorithms
Source Lamport's bakery algorithm (Wikipedia)
Lamport's distributed mutual exclusion algorithm, Algorithms
Source Lamport's distributed mutual exclusion algorithm (Wikipedia)

In Field

Distributed Computing, Fields
Source Wikipedia: Leslie Lamport

Invented

Byzantine Fault Tolerance, Concepts

Leslie Lamport co-authored the 1982 paper (with Robert Shostak and Marshall Pease) that formulated the Byzantine Generals Problem and named Byzantine fault tolerance.

Consensus Problem, Concepts

Leslie Lamport's Byzantine Generals and Paxos work formulated the distributed consensus problem in its modern form.

Lamport's distributed mutual exclusion algorithm, Algorithms
Source Communications of the ACM (Leslie Lamport, 1978): Time, Clocks, and the Ordering of Events in a Distributed System

Invented By

Chandy-Lamport algorithm, Algorithms
Source Chandy-Lamport algorithm (Wikipedia)
Lamport timestamp, Algorithms
Source Lamport timestamp (Wikipedia)
Lamport's bakery algorithm, Algorithms
Source Lamport's bakery algorithm (Wikipedia)

Long-Form Articles

From logical clocks to TLA+: how Lamport made distributed systems checkable, Articles
In the Other Atlases

Is Discussed By

Turing Award

Also in Science Atlas: which discusses this subject.

Source Wikipedia: Leslie Lamporttier 2

Nationality

United States

Also in Geography Atlas: the nationality of this subject.

Sources
1. Wikidata: Leslie Lamport
Wikidata Q92613, class allow-list match (w-wdresolver-0926)View the Source
2. Wikipedia: Leslie Lamport
Wikimedia Foundation
  • Lead section
    born February 7, 1941
  • In Field: Distributed Computing, Lead paragraph
View the Source
Lamport timestamp (Wikipedia)
  • Invented By: Lamport timestamp, Lead [invented]
    The algorithm is named after its creator, Leslie Lamport.
  • Credited: Lamport timestamp, Lead [credited-to]
    The algorithm is named after its creator, Leslie Lamport.
View the Source
Chandy-Lamport algorithm (Wikipedia)
  • Invented By: Chandy-Lamport algorithm, Lead section [invented]
    It was developed by and named after Leslie Lamport and K. Mani Chandy.
  • Credited: Chandy-Lamport algorithm, Lead section [invented]
    It was developed by and named after Leslie Lamport and K. Mani Chandy.
View the Source
Lamport's bakery algorithm (Wikipedia)
  • Invented By: Lamport's bakery algorithm, Lead, first sentence
    Lamport's bakery algorithm is a computer algorithm devised by computer scientist Leslie Lamport
  • Credited: Lamport's bakery algorithm, Lead, first sentence
    Lamport's bakery algorithm is a computer algorithm devised by computer scientist Leslie Lamport
View the Source
Lamport's distributed mutual exclusion algorithm (Wikipedia)
Credited: Lamport's distributed mutual exclusion algorithm, Article lead, title of the algorithm
Quote, Credited: Lamport's distributed mutual exclusion algorithm, Article lead, title of the algorithm
Lamport's Distributed Mutual Exclusion Algorithm is a contention-based algorithm for mutual exclusion on a distributed system.
View the Source
Communications of the ACM (Leslie Lamport, 1978): Time, Clocks, and the Ordering of Events in a Distributed System
Communications of the ACM (Leslie Lamport, 1978)Invented: Lamport's distributed mutual exclusion algorithm, PDF page 4
Quote, Invented: Lamport's distributed mutual exclusion algorithm, PDF page 4
We will illustrate the use of this total ordering of events by solving the following version of the mutual exclusion problem.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.