Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Building a Theory of Distributed Systems: Work by Nancy Lynch and Collaborators

Nancy Lynch

TL;DR

This survey traces the development of distributed computing theory from its inception at Georgia Tech through MIT and beyond, detailing the shift from early mutual-exclusion and modeling efforts to the FLP impossibility and the rise of consensus with partial synchrony. It highlights core methods—formal automata-based models (notably I/O Automata), abstraction, composition, and timing analyses—along with key results (e.g., FLP, CAP, k-set agreement) and their practical import for data management, networks, and security. The narrative then covers formal methods for timed, hybrid, and probabilistic systems, followed by advances in wireless networks and, more recently, biological distributed algorithms, underscoring the field’s breadth and enduring relevance. Collectively, the work has established a rigorous theoretical foundation for designing and verifying distributed systems, while inspiring practical architectures and robust protocols in diverse settings.

Abstract

In this manuscript I overview my work on developing a Theory for Distributed Systems -- work that has involved many students and other collaborators. This effort started at Georgia Tech in the late 1970s, and has continued at MIT since 1981. This manuscript emphasizes the earlier contributions, and their impact on the directions of the field. These contributions include new distributed algorithms; rigorous proofs and analysis; discovery of errors in previous algorithms; lower bounds and other impossibility results expressing inherent limitations on the power of distributed systems; general mathematical foundations for modeling and analyzing distributed systems; and applications of these methods to understanding a variety of practical distributed systems, including distributed data-management systems, wired and wireless communication systems, and biological systems.

Building a Theory of Distributed Systems: Work by Nancy Lynch and Collaborators

TL;DR

This survey traces the development of distributed computing theory from its inception at Georgia Tech through MIT and beyond, detailing the shift from early mutual-exclusion and modeling efforts to the FLP impossibility and the rise of consensus with partial synchrony. It highlights core methods—formal automata-based models (notably I/O Automata), abstraction, composition, and timing analyses—along with key results (e.g., FLP, CAP, k-set agreement) and their practical import for data management, networks, and security. The narrative then covers formal methods for timed, hybrid, and probabilistic systems, followed by advances in wireless networks and, more recently, biological distributed algorithms, underscoring the field’s breadth and enduring relevance. Collectively, the work has established a rigorous theoretical foundation for designing and verifying distributed systems, while inspiring practical architectures and robust protocols in diverse settings.

Abstract

In this manuscript I overview my work on developing a Theory for Distributed Systems -- work that has involved many students and other collaborators. This effort started at Georgia Tech in the late 1970s, and has continued at MIT since 1981. This manuscript emphasizes the earlier contributions, and their impact on the directions of the field. These contributions include new distributed algorithms; rigorous proofs and analysis; discovery of errors in previous algorithms; lower bounds and other impossibility results expressing inherent limitations on the power of distributed systems; general mathematical foundations for modeling and analyzing distributed systems; and applications of these methods to understanding a variety of practical distributed systems, including distributed data-management systems, wired and wireless communication systems, and biological systems.

Paper Structure

This paper contains 62 sections, 1 figure.

Table of Contents

  1. Introduction
  2. Contents of this manuscript:
  3. Accessing the papers:
  4. Complexity Theory, 1970-1975
  5. Early Explorations of Theory for Distributed Computing, at Georgia Tech, 1976-1981
  6. Key publications
  7. Mutual exclusion in shared-memory models
  8. Bounds on test-and-set shared memory for mutual exclusion and resource allocation:
  9. Limitations for read/write shared memory:
  10. Models for distributed systems
  11. General model for asynchronous shared-memory computing:
  12. Synchronous vs. asynchronous shared memory systems:
  13. Other early results
  14. Resource allocation in networks:
  15. Global states:
  16. ...and 47 more sections

Figures (1)

  • Figure 1: If this were a book, this could be its cover design. The school of fish is a kind of natural distributed system. The school could also represent all the collaborators.