Leslie Lamport Contributed to Theory and Practice of Building Distributed Computing Systems that Work as Intended
Leslie Lamport (photo courtesy of Microsoft Research)
Award Citation
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.
Longer CitationLeslie Lamport originated many of the key concepts of distributed and concurrent computing, including causality and logical clocks, replicated state machines, and sequential consistency. Along with others, he invented the notion of Byzantine failure and algorithms for reaching agreement despite such failures. He contributed to the development and understanding of proof methods for concurrent systems, notably by introducing the notions of safety and liveness as the proper generalizations of partial correctness and termination to the concurrent setting. In addition, he devised important distributed algorithms and developed a substantial collection of formal modeling and verification methods and tools that have been used to improve the quality of real distributed systems. His contributions share a common theme: to impose clear and well-defined coherence on the seemingly chaotic behavior of a collection of distributed processes. They make it substantially easier for algorithm designers to design distributed algorithms, and for programmers to write distributed programs.
Background
Leslie Lamport is a Principal Researcher at Microsoft Research. He received the IEEE Emanuel R. Piore Award for his contributions to the theory and practice of concurrent programming and fault-tolerant computing. He was also awarded the Edsger W. Dijkstra Prize in Distributed Computing for his paper “Reaching Agreement in the Presence of Faults.” He won the IEEE John von Neumann Medal and was also elected to the U.S. National Academy of Engineering and the U.S. National Academy of Sciences.
Prior to his current position, his career included extended tenures at SRI International and Digital Equipment Corporation (later Compaq Corporation). The author or co-author of nearly 150 publications on concurrent and distributed computing and their applications, he holds a B.S. degree in mathematics from Massachusetts Institute of Technology as well as M.S. and Ph.D. degrees in mathematics from Brandeis University.
ACM will present the 2013 A.M. Turing Award at its annual Awards Banquet on June 21 in San Francisco, California.
Leslie Lamport (photo courtesy of Microsoft Research)
Award Citation
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.
Longer CitationLeslie Lamport originated many of the key concepts of distributed and concurrent computing, including causality and logical clocks, replicated state machines, and sequential consistency. Along with others, he invented the notion of Byzantine failure and algorithms for reaching agreement despite such failures. He contributed to the development and understanding of proof methods for concurrent systems, notably by introducing the notions of safety and liveness as the proper generalizations of partial correctness and termination to the concurrent setting. In addition, he devised important distributed algorithms and developed a substantial collection of formal modeling and verification methods and tools that have been used to improve the quality of real distributed systems. His contributions share a common theme: to impose clear and well-defined coherence on the seemingly chaotic behavior of a collection of distributed processes. They make it substantially easier for algorithm designers to design distributed algorithms, and for programmers to write distributed programs.
Background
Leslie Lamport is a Principal Researcher at Microsoft Research. He received the IEEE Emanuel R. Piore Award for his contributions to the theory and practice of concurrent programming and fault-tolerant computing. He was also awarded the Edsger W. Dijkstra Prize in Distributed Computing for his paper “Reaching Agreement in the Presence of Faults.” He won the IEEE John von Neumann Medal and was also elected to the U.S. National Academy of Engineering and the U.S. National Academy of Sciences.
Prior to his current position, his career included extended tenures at SRI International and Digital Equipment Corporation (later Compaq Corporation). The author or co-author of nearly 150 publications on concurrent and distributed computing and their applications, he holds a B.S. degree in mathematics from Massachusetts Institute of Technology as well as M.S. and Ph.D. degrees in mathematics from Brandeis University.
ACM will present the 2013 A.M. Turing Award at its annual Awards Banquet on June 21 in San Francisco, California.
No comments:
Post a Comment