Complexity of Communication Among Asynchronous Parallel Processes.

Abstract

Certain problems of synchronization for systems of processes which execute asynchronously and communicate through shared variables or message passing are explored. Solutions are obtained for deadlock free mutual exclusion and lockout-free mutual exclusion for N processes communicating by shared variables. For systems which communicate by passing messages, a solution to the 'election problem' is presented - choosing a single process to become the system controller in an initial configuration of N processes in which no process has any information about the number or the identity of the other processes in the system. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1981
Accession Number
ADA099302

Entities

People

  • James E. Burns

Organizations

  • Georgia Tech

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Asynchronous Systems
  • Classification
  • Computer Science
  • Computers
  • Contracts
  • Elections
  • Identities
  • Military Research
  • Plastic Explosives
  • Security
  • Three Dimensional

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Parallel and Distributed Computing.