Leslie Lamport

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Leslie Lamport
Leslie Lamport.jpg
Born (1941-02-07) February 7, 1941 (age 75)
New York City, New York
Fields Computer science
Alma mater
Thesis The analytic Cauchy problem with singular data (1972)
Doctoral advisor Richard Palais[1]
Known for
Notable awards Dijkstra Prize (2000, 2005, and 2014)
IEEE Emanuel R. Piore Award (2004)
IEEE John von Neumann Medal (2008)
ACM Turing Award (2013)
ACM Fellow (2014)

Leslie B. Lamport (born February 7, 1941) is an American computer scientist. Lamport is best known for his seminal work in distributed systems and as the initial developer of the document preparation system LaTeX.[2] Leslie Lamport was the winner of the 2013 Turing Award[3] for imposing clear, well-defined coherence on the seemingly chaotic behavior of distributed computing systems, in which several autonomous computers communicate with each other by passing messages. He devised important algorithms and developed formal modeling and verification protocols that improve the quality of real distributed systems. These contributions have resulted in improved correctness, performance, and reliability of computer systems.[4][5][6][7][8]

Early life and education[edit]

A graduate of the Bronx High School of Science, he received a B.S. in mathematics from the Massachusetts Institute of Technology in 1960, and M.A. and Ph.D. degrees in mathematics from Brandeis University, respectively in 1963 and 1972.[9] His dissertation was about singularities in analytic partial differential equations.[10]


Professionally, Lamport worked as a computer scientist at Massachusetts Computer Associates from 1970 to 1977, SRI International from 1977 to 1985, and Digital Equipment Corporation and Compaq from 1985 to 2001. In 2001 he joined Microsoft Research in Mountain View, California, which closed in 2014.[9]

Lamport’s research contributions have laid the foundations of the theory of distributed systems. Among his most notable papers are

These papers relate to such concepts as logical clocks (and the happened-before relationship) and Byzantine failures. They are among the most cited papers in the field of computer science[16] and describe algorithms to solve many fundamental problems in distributed systems, including:

Lamport is also known for his work on temporal logic, where he introduced the temporal logic of actions (TLA).[17][18] Among his more recent contributions is TLA+, a language for specifying and reasoning about concurrent and reactive systems, that he describes in the book “Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers”[19] and defines as a “quixotic attempt to overcome engineers' antipathy towards mathematics”.[20]

Awards and memberships[edit]

Lamport received the 2013 ACM A.M. Turing Award for "fundamental contributions to the theory and practice of distributed and concurrent systems, notably the invention of concepts such as causality and logical clocks, safety and liveness, replicated state machines, and sequential consistency" in 2014.[21] He was elected to Fellow of ACM (2014).[22] He also received five honorary doctorates from European universities: University of Rennes and Christian Albrechts University of Kiel in 2003, EPFL in 2004, University of Lugano in 2006, and Nancy-Université in 2007.[9] In 2004, he received the IEEE Emanuel R. Piore Award.[23] In 2005, the paper “Reaching Agreement in the Presence of Faults”[24] received the Dijkstra Prize.[25] In honor of Lamport's sixtieth birthday, a lecture series was organised at the 20th Symposium on Principles of Distributed Computing (PODC 2001).[26] In 2008, he received the IEEE John von Neumann Medal.[27] In 2011, he was elected to the United States National Academy of Sciences.[28] He was named ACM Fellow[29] 2014 for fundamental contributions to the theory and practice of distributed and concurrent systems.

See also[edit]


  1. ^ Leslie Lamport at the Mathematics Genealogy Project
  2. ^ Lamport, Leslie (1986). LaTeX: A Document Preparation System. Addison-Wesley. ISBN 0-201-15790-X. Retrieved 2007-02-02. 
  3. ^ Lamport, Leslie (2013). "Leslie Lamport - A.M. Turing Award Winner". ACM. 
  4. ^ Leslie Lamport from the ACM Digital Library
  5. ^ a b Lamport, L. (1978). "Time, clocks, and the ordering of events in a distributed system" (PDF). Communications of the ACM . 21 (7): 558–565. doi:10.1145/359545.359563. 
  6. ^ List of publications from Microsoft Academic Search
  7. ^ Savage, N. (2014). "General agreement: Leslie Lamport contributed to the theory and practice of building distributed computing systems that work as intended". Communications of the ACM. 57 (6): 22–23. doi:10.1145/2601076. 
  8. ^ Hoffmann, L. (2014). "Q&A Divide and Conquer: Leslie Lamport on Byzantine generals, clocks, and other tools for reasoning about concurrent systems". Communications of the ACM. 57 (6): 112–ff. doi:10.1145/2601077. 
  9. ^ a b c Lamport, Leslie (2006-12-19). "My Writings". Retrieved 2007-02-02. 
  10. ^ Lamport, Leslie (1972). "The Analytic Cauchy Problem with Singular Data". Retrieved 2007-02-02. 
  11. ^ Neiger, Gil (2003-01-23). "PODC Influential Paper Award: 2000". Retrieved 2007-02-02. 
  12. ^ Lamport, Leslie (1979). "How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Program". IEEE Trans. Comput. 28 (9): 690–691. doi:10.1109/TC.1979.1675439. ISSN 0018-9340. 
  13. ^ Lamport, Leslie; Robert Shostak; Marshall Pease (July 1982). "The Byzantine Generals Problem". ACM Transactions on Programming Languages and Systems. 4 (3): 382–401. doi:10.1145/357172.357176. Retrieved 2007-02-02. 
  14. ^ Chandy, K. Mani; Leslie Lamport (February 1985). "Distributed Snapshots: Determining Global States of a Distributed System". ACM Transactions on Computer Systems. 3 (1): 63–75. doi:10.1145/214451.214456. Retrieved 2007-02-02. 
  15. ^ Lamport, Leslie (May 1998). "The Part-Time Parliament". ACM Transactions on Computer Systems. 16 (2): 133–169. doi:10.1145/279227.279229. Retrieved 2007-02-02. 
  16. ^ "Most cited articles in Computer Science". September 2006. Retrieved 2007-10-08. 
  17. ^ Lamport, Leslie (1990-04-01). "A Temporal Logic of Actions". Retrieved 2007-02-02. 
  18. ^ Lamport, Leslie (May 1994). "The Temporal Logic of Actions". ACM Transactions on Programming Languages and Systems. 16 (3): 872–923. doi:10.1145/177492.177726. Retrieved 2007-02-02. 
  19. ^ Lamport, Leslie (2002). Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley. ISBN 0-321-14306-X. Retrieved 2007-02-02. 
  20. ^ "The International Conference on Dependable Systems and Networks keynote speaker biography". Retrieved 2007-03-06. 
  21. ^ "Turing award 2013". ACM. 
  22. ^ Leslie Lamport ACM Fellows 2014
  23. ^ "IEEE Emanuel R. Piore Award Recipients es" (PDF). IEEE. Retrieved 2010-12-31. 
  24. ^ Pease, Marshall; Robert Shostak; Leslie Lamport (April 1980). "Reaching Agreement in the Presence of Faults". Journal of the Association for Computing Machinery. 27 (2): 228–234. doi:10.1145/322186.322188. Retrieved 2007-02-02. 
  25. ^ "Edsger W. Dijkstra Prize in Distributed Computing: 2005". Retrieved 2007-02-02. 
  26. ^ "PODC 2001: Lamport Lecture Series". Retrieved 2009-07-02. 
  27. ^ "IEEE John von Neumann Medal Recipients" (PDF). IEEE. Retrieved December 31, 2010. 
  28. ^ Members and Foreign Associates Elected Archived May 7, 2011, at the Wayback Machine., National Academy of Sciences, May 3, 2011.
  29. ^ ACM Names Fellows for Innovations in Computing, Association for Computing Machinery, January 8, 2015.