Search results
Results from the WOW.Com Content Network
Nancy Ann Lynch (born January 19, 1948) [1] is a computer scientist affiliated with the Massachusetts Institute of Technology.She is the NEC Professor of Software Science and Engineering in the EECS department and heads the "Theory of Distributed Systems" research group at MIT's Computer Science and Artificial Intelligence Laboratory.
The I/O automata were first introduced by Nancy A. Lynch and Mark R. Tuttle in "Hierarchical correctness proofs for distributed algorithms", 1987. [2] "An I/O automaton models a distributed system component that can interact with other system components.
A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributed algorithms are used in different application areas of distributed computing , such as telecommunications , scientific computing , distributed information processing , and real-time process control .
It was published as the CAP principle in 1999 [10] and presented as a conjecture by Brewer at the 2000 Symposium on Principles of Distributed Computing (PODC). [11] In 2002, Seth Gilbert and Nancy Lynch of MIT published a formal proof of Brewer's conjecture, rendering it a theorem. [1]
He is also known for his work in several other areas, including Distributed Algorithms. In Nancy Lynch's book Distributed Algorithms she gives details of an algorithm by Hirschberg and J. B. Sinclair for leader election in a synchronous ring. Lynch named this algorithm the HS algorithm, after its authors. [2]
The conferences listed here are major conferences of the area; they have been selected using the following criteria:- the notability of the conference has been confirmed by multiple independent sources; for example, it has been mentioned in textbooks [1] [2] [3] or other sources, [4] [5] or it has received a high ranking [6]
The distributed minimum spanning tree (MST) problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network where nodes communicate by message passing. It is radically different from the classical sequential problem, although the most basic approach resembles Borůvka's algorithm .
The Hirschberg–Sinclair algorithm is a distributed algorithm designed for leader election problem in a synchronous ring network. It is named after its inventors, Dan Hirschberg and J. B. Sinclair. The algorithm requires the use of unique IDs (UID) for each process. The algorithm works in phases and sends its UID out in both directions.