Complexity of communication among asynchronous parallel processes
James E. Burns · UPT. Syiah Kuala University Library (Syiah Kuala University) · 1981
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)