World Library  
Flag as Inappropriate
Email this Article

Leslie Lamport

Article Id: WHEBN0000195671
Reproduction Date:

Title: Leslie Lamport  
Author: World Heritage Encyclopedia
Language: English
Subject: BibTeX, Lamport signature, List of Turing Award laureates by university affiliation, Turing Award, Clock Constraints Specification Language
Collection: 1941 Births, 20Th-Century American Mathematicians, 21St-Century American Mathematicians, American Computer Scientists, Brandeis University Alumni, Computer Science Writers, Digital Equipment Corporation People, Dijkstra Prize Laureates, Formal Methods People, Living People, Massachusetts Institute of Technology Alumni, Members of the United States National Academy of Sciences, Microsoft Employees, Researchers in Distributed Computing, Sri International People, The Bronx High School of Science Alumni, Turing Award Laureates
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Leslie Lamport

Leslie Lamport
Born (1941-02-07) February 7, 1941
New York City, New York
Fields Computer science
Institutions
Alma mater
Thesis The analytic Cauchy problem with singular data (1972)
Doctoral advisor Richard Palais[1]
Known for
Notable awards Dijkstra Prize (2000 and 2005)
IEEE Emanuel R. Piore Award (2004)
IEEE John von Neumann Medal (2008)
ACM Turing Award (2013)
ACM Fellow (2014)
Website
.org.lamportwww

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]

Contents

  • Early life and education 1
  • Career 2
  • Awards and memberships 3
  • References 4

Early life and education

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]

Career

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.[9]

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

  • “Time, Clocks, and the Ordering of Events in a Distributed System”,[5] which received the PODC Influential Paper Award in 2000,[11]
  • “How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs”,[12] which defined the notion of Sequential consistency,
  • The Byzantine Generals' Problem”,[13]
  • “Distributed Snapshots: Determining Global States of a Distributed System”[14] and
  • “The Part-Time Parliament”.[15]

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

Lamport received the 2013 ACM 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.

References

  1. ^ Leslie Lamport at the Mathematics Genealogy Project
  2. ^ Lamport, Leslie (1986). LaTeX: A Document Preparation System. Addison-Wesley.  
  3. ^ Lamport, Leslie (2013). "Leslie Lamport - A.M. Turing Award Winner". ACM. 
  4. ^ Leslie Lamport from the Association for Computing Machinery (ACM) Digital Library
  5. ^ a b Lamport, L. (1978). "Time, clocks, and the ordering of events in a distributed system" (PDF).  
  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.  
  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.  
  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.  
  13. ^ Lamport, Leslie; Robert Shostak; Marshall Pease (July 1982). "The Byzantine Generals Problem". ACM Transactions on Programming Languages and Systems 4 (3): 382–401.  
  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.  
  15. ^ Lamport, Leslie (May 1998). "The Part-Time Parliament". ACM Transactions on Computer Systems 16 (2): 133–169.  
  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.  
  19. ^ Lamport, Leslie (2002). Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley.  
  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). 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, National Academy of Sciences, May 3, 2011.
  29. ^ ACM Names Fellows for Innovations in Computing, Association for Computing Machinery, January 8, 2015.
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.