A Computability Theory for Distributed Systems.

Abstract

The work proposed under this grant was to develop theories which will contribute to the design and analysis of distributed systems. The major emphasis of the proposed research was to study how and why processes in a a message passing system need to communicate. Contents; Learning from incomplete information; Understanding a Byzantine algorithm; On the nonexistence of robust commit protocol; How processes learn; A Really abstract concurrent model and its temporal logic; Systolic algorithms as programs.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 13, 1986
Accession Number
ADA166081

Entities

People

  • Jayadev Misra

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Circuits
  • Command And Control
  • Command And Control Systems
  • Computations
  • Computer Communications
  • Computer Programming
  • Computer Science
  • Computers
  • Digestive System Processes
  • Distributed Computing
  • Electrical Engineering
  • Electronic Circuits
  • Information Transfer
  • Language
  • Military Research
  • Network Protocols

Readers

  • Mathematical Modeling and Probability Theory.
  • Parallel and Distributed Computing.
  • STEM Education