A Technique For Decomposing Algorithms Which Use a Single Shared Variable (1980)
by
Nancy A. Lynch
,
Michael J. Fischer
| Citations: | 2 - 2 self |
BibTeX
@MISC{Lynch80atechnique,
author = {Nancy A. Lynch and Michael J. Fischer},
title = {A Technique For Decomposing Algorithms Which Use a Single Shared Variable},
year = {1980}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A general theorem is proved which shows how a system of contending asynchronous processes with a special auxiliary supervisor process can be Simulated by a system of contending processes without such a supervisor, with only a small increase in the shared space needed for communication. Two applications are presented, synchronization algorithms with different fairness properties requiring N + c and I 1 + c (c a constant) shared values to synchronize N processes, respectively.
Citations
| 259 | Solution of a problem in concurrent programming control - Dijkstra - 1965 |
| 32 | Resource Allocation with Immunity to Limited Process Failure (Preliminary Report - Fischer, Lynch, et al. - 1979 |
| 6 | Shared data requirements for implementation of mutual exclusion using a test-and-set primitive - Burns, Fischer, et al. - 1978 |
| 5 | Arbitration and Queueing Under Limited Shared Storage Requirements." Forschungsbericht Nr. 83 - Cremers, HIbbard - 1979 |
| 1 | Mutual Exclusion of N processors Using 0(N)-valued Message Variable." (extended abstract). USC - Cremers, Hibbard - 1977 |
