| 词条 | Leslie Lamport |
| 释义 |
| name = Leslie Lamport | image = Leslie Lamport.jpg | caption = | birth_date = {{birth date and age|1941|02|07}} | birth_place = New York City, New York | residence = | citizenship = | nationality = | alma_mater = {{Plainlist|
| thesis_title = The analytic Cauchy problem with singular data | thesis_url = http://search.proquest.com/docview/288284622 | thesis_year = 1972 | doctoral_advisor = Richard Palais[1] | doctoral_students = | known_for ={{Plainlist|
| website = {{URL|http://www.lamport.org}} | footnotes = | ethnicity = | field = Computer science | work_institution = {{Plainlist|
| author_abbreviation_bot = | author_abbreviation_zoo = | prizes = {{no wrap|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)}} | religion = }}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 educationA 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] CareerProfessionally, 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 membershipsLamport 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
References1. ^{{MathGenealogy|id=35871}} {{Turing Award laureates}}{{Authority control}}{{DEFAULTSORT:Lamport, Leslie}}2. ^{{cite book|last=Lamport|first=Leslie|title=LaTeX: A Document Preparation System|year=1986|publisher=Addison-Wesley|isbn=978-0-201-15790-1|url=http://research.microsoft.com/users/lamport/pubs/pubs.html#latex|accessdate=2007-02-02}} 3. ^{{cite news|last=Lamport|first=Leslie|title=Leslie Lamport - A.M. Turing Award Winner|year=2013|publisher=ACM|url=http://amturing.acm.org/award_winners/lamport_1205376.cfm}} 4. ^{{ACMPortal|id=81100244989}} 5. ^1 {{Cite journal | last1 = Lamport | first1 = L. |authorlink1=Leslie Lamport| title = Time, clocks, and the ordering of events in a distributed system | doi = 10.1145/359545.359563 | journal = Communications of the ACM| volume = 21 | issue = 7 | pages = 558–565| year = 1978 | url=http://research.microsoft.com/users/lamport/pubs/time-clocks.pdf| citeseerx = 10.1.1.142.3682 }} 6. ^{{AcademicSearch|1817419}} 7. ^{{Cite journal | doi = 10.1145/2601076| title = General agreement: Leslie Lamport contributed to the theory and practice of building distributed computing systems that work as intended| journal = Communications of the ACM| volume = 57| issue = 6| pages = 22–23| year = 2014| last1 = Savage | first1 = N. }} 8. ^{{Cite journal | doi = 10.1145/2601077| title = Q&A Divide and Conquer: Leslie Lamport on Byzantine generals, clocks, and other tools for reasoning about concurrent systems| journal = Communications of the ACM| volume = 57| issue = 6| pages = 112–ff| year = 2014| last1 = Hoffmann | first1 = L. }} 9. ^1 2 {{cite web|last=Lamport|first=Leslie|title=My Writings|url=http://research.microsoft.com/users/lamport/pubs/pubs.html|date=2006-12-19|accessdate=2007-02-02}} 10. ^{{cite journal |first=Leslie |last=Lamport |title=The Analytic Cauchy Problem with Singular Data |year=1972 |url=http://research.microsoft.com/users/lamport/pubs/pubs.html#thesis |accessdate=2007-02-02}} 11. ^{{cite web|last=Neiger|first=Gil|title=PODC Influential Paper Award: 2000|date=2003-01-23|url=http://www.podc.org/influential/2000.html|accessdate=2007-02-02}} 12. ^{{cite journal|last=Lamport|first=Leslie|title=How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Program|url = http://research.microsoft.com/en-us/um/people/lamport/pubs/pubs.html#multi|journal = IEEE Trans. Comput.|volume = 28|year = 1979|issn = 0018-9340|pages = 690–691|doi = 10.1109/TC.1979.1675439|issue = 9}} 13. ^{{cite journal|last=Lamport|first=Leslie|author2=Robert Shostak |author3=Marshall Pease |date=July 1982|title=The Byzantine Generals Problem|journal=ACM Transactions on Programming Languages and Systems|volume=4|issue=3|pages=382–401|url=http://research.microsoft.com/users/lamport/pubs/pubs.html#byz|accessdate=2007-02-02|doi=10.1145/357172.357176|citeseerx=10.1.1.64.2312}} 14. ^{{cite journal|last=Chandy|first=K. Mani|author2=Leslie Lamport |date=February 1985|title=Distributed Snapshots: Determining Global States of a Distributed System|journal=ACM Transactions on Computer Systems|volume=3|issue=1|pages=63–75|url=http://research.microsoft.com/users/lamport/pubs/pubs.html#chandy|accessdate=2007-02-02|doi=10.1145/214451.214456|citeseerx=10.1.1.69.2561}} 15. ^{{cite journal|last=Lamport|first=Leslie|date=May 1998|title=The Part-Time Parliament|journal=ACM Transactions on Computer Systems|volume=16|issue=2|pages=133–169|url=http://research.microsoft.com/users/lamport/pubs/pubs.html#lamport-paxos|accessdate=2007-02-02|doi=10.1145/279227.279229}} 16. ^{{cite web|title=Most cited articles in Computer Science|date=September 2006|url=http://citeseer.ist.psu.edu/articles.html|accessdate=2007-10-08}} 17. ^{{cite journal |first=Leslie |last=Lamport |title=A Temporal Logic of Actions |date=1990-04-01 |url=http://research.microsoft.com/users/lamport/pubs/pubs.html#old-tla-src |accessdate=2007-02-02}} 18. ^{{cite journal |last=Lamport |first=Leslie |date=May 1994 |title=The Temporal Logic of Actions |journal=ACM Transactions on Programming Languages and Systems |volume=16 |issue=3 |pages=872–923 |url=http://research.microsoft.com/users/lamport/pubs/pubs.html#lamport-actions|accessdate=2007-02-02 |doi=10.1145/177492.177726}} 19. ^{{cite book|last=Lamport|first=Leslie|year=2002|title=Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers|publisher=Addison-Wesley|isbn=978-0-321-14306-8|url=http://research.microsoft.com/users/lamport/tla/book.html|accessdate=2007-02-02}} 20. ^{{cite web |title=The International Conference on Dependable Systems and Networks keynote speaker biography |url=http://2004.dsn.org/keynote.html |accessdate=2007-03-06}} 21. ^{{cite web |url=http://amturing.acm.org/award_winners/lamport_1205376.cfm |title=Turing award 2013 |publisher=ACM}} 22. ^Leslie Lamport ACM Fellows 2014 23. ^{{cite web |url=http://www.ieee.org/documents/piore_rl.pdf |title=IEEE Emanuel R. Piore Award Recipients es |publisher=IEEE |accessdate=2010-12-31 |archive-url=https://web.archive.org/web/20101124232834/http://ieee.org/documents/piore_rl.pdf |archive-date=2010-11-24 |dead-url=yes |df= }} 24. ^{{cite journal|last=Pease|first=Marshall|author2=Robert Shostak |author3=Leslie Lamport |date=April 1980|title=Reaching Agreement in the Presence of Faults|journal=Journal of the Association for Computing Machinery|volume=27|issue=2|url=http://research.microsoft.com/users/lamport/pubs/pubs.html#reaching|accessdate=2007-02-02|doi=10.1145/322186.322188|pages=228–234|citeseerx=10.1.1.68.4044}} 25. ^{{cite web|title=Edsger W. Dijkstra Prize in Distributed Computing: 2005|url=http://www.podc.org/dijkstra/2005.html|accessdate=2007-02-02}} 26. ^{{cite web|title=PODC 2001: Lamport Lecture Series|url=http://www.podc.org/podc2001/festschrift.html|accessdate=2009-07-02}} 27. ^{{cite web|url=http://www.ieee.org/documents/von_neumann_rl.pdf |title=IEEE John von Neumann Medal Recipients |publisher=IEEE |accessdate=December 31, 2010}} 28. ^Members and Foreign Associates Elected {{webarchive |url=https://web.archive.org/web/20110507232125/http://www.nasonline.org/site/PageServer?pagename=News_May_3_2011_member_election |date=May 7, 2011 }}, National Academy of Sciences, May 3, 2011. 29. ^ACM Names Fellows for Innovations in Computing {{webarchive|url=https://web.archive.org/web/20150114081835/http://www.acm.org/press-room/news-releases/2015/fellows-2014 |date=2015-01-14 }}, Association for Computing Machinery, January 8, 2015. 22 : American computer scientists|1941 births|Living people|Computer science writers|Formal methods people|Researchers in distributed computing|Members of the United States National Academy of Sciences|Dijkstra Prize laureates|Turing Award laureates|Digital Equipment Corporation people|Microsoft employees|SRI International people|The Bronx High School of Science alumni|Brandeis University alumni|Massachusetts Institute of Technology alumni|20th-century American engineers|21st-century American engineers|20th-century American mathematicians|21st-century American mathematicians|20th-century American scientists|21st-century American scientists|Mathematicians from New York (state) |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。