Complexity of Communication Among Asynchronous Parallel Processes.
Technical rept. 1 Sep 79-14 Jan 81,
GEORGIA INST OF TECH ATLANTA SCHOOL OF INFORMATION AND COMPUTER SCIENCE
Pagination or Media Count:
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
- Computer Hardware
- Computer Systems
- Non-Radio Communications