Leslie Lamport
一、分布式计算领域的开拓者，凭借一己之力，构筑了分布式计算大厦的底座，在下面文章中，对他进行了介绍:
1、范斌 zhihu 漫话分布式系统共识协议: Paxos篇
在我看来, Paxos算法(连同Lamport的其他如BFT, Vector Clock等成就)是上个世纪八十/九十年代的经典分布式系统研究中最纯粹最优美, 也是整栋大厦底座最坚实的那一部分.
二、cornell Distributed Systems: Ordering and Consistency
wikipedia Leslie Lamport
Leslie Lamport was the winner of the 2013 Turing Award[4] 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.
NOTE: "make it computational"
Career and research
Distributed Systems
NOTE: 需要对它在Distributed Systems中的理论了解一下
Lamport's research contributions have laid the foundations of the theory of distributed systems. Among his most notable papers are
1、"Time, Clocks, and the Ordering of Events in a Distributed System",[6] which received the PODC Influential Paper Award in 2000,[12]
NOTE: lamport timestamp
2、"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs",[13] which defined the notion of sequential consistency,
3、"The Byzantine Generals' Problem",[14]
4、"Distributed Snapshots: Determining Global States of a Distributed System"[15] and
5、"The Part-Time Parliament".[16]
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,[17] and describe algorithms to solve many fundamental problems in distributed systems, including:
NOTE: 上述 happened-before让我想起来C++ memory model中的std::memory_order中的*happens-before*
1、the Paxos algorithm for consensus,
2、the bakery algorithm for mutual exclusion of multiple threads in a computer system that require the same resources at the same time,
3、the Chandy-Lamport algorithm for the determination of consistent global states (snapshot), and
4、the Lamport signature, one of the prototypes of the digital signature.