Chapter on Distributed Computing

Abstract

Rigorous analysis starts with a precise model of a distributed system; the most popular models, differing in how they represent interprocess communication, are message passing, shared variables, and synchronous communication. The properties satisfied by an algorithm must be precisely stated and carefully proved; the most successful approach is based on assertional reasoning. Algorithms for solving particular problems in a distributed system can then be designed and analyzed. Typical of the problems that have been addressed are: concurrently accessing shared data, achieving consensus, analyzing network topology, obtaining consistent global information, and controlling database transactions.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1989
Accession Number
ADA208996

Entities

People

  • Leslie Lamport
  • Nancy Lynch

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Authentication
  • Computations
  • Computer Networks
  • Computer Programming
  • Computer Science
  • Computers
  • Consensus Algorithms
  • Control Systems
  • Databases
  • Distributed Computing
  • Failure Mode And Effect Analysis
  • Fault Tolerance
  • Information Processing
  • Military Research
  • Network Topology
  • Programming Languages
  • Reliability

Fields of Study

  • Computer science

Readers

  • Database Systems and Applications
  • Distributed Systems and Data Platform Development
  • Mathematical Modeling and Probability Theory.