论文信息 - Implementing semaphores by binary semaphores

Implementing semaphores by binary semaphores

The author presenting the semaphore mechanism, Dijkstra (1968) supposed every semaphore solution to be describable using only binary semaphores. In this paper, several earlier solutions are analysed and new alternatives are introduced. The solution that is finally proposed may be regarded as optimal with respect to the number of additional semaphores and variables. 10 references.

Hans W. Barz | H. Barz

[1] Alain J. Martin,et al. Two Implementations of the Conditional Critical Region Using a Split Binary Semaphore , 1979, Information Processing Letters.

[2] Edsger W. Dijkstra,et al. Co-operating sequential processes , 1968 .

[3] Hans W. Barz. The Power of Synchronization Mechanisms , 1984, SIAM J. Comput..

[4] Richard J. Lipton. Limitations of synchronization primitives with conditional branching and global variables , 1974, STOC '74.

[5] C. A. R. Hoare,et al. Monitors: an operating system structuring concept , 1974, CACM.

[6] Richard J. Lipton,et al. Reduction: a method of proving properties of parallel programs , 1975, CACM.