Limitations of synchronization primitives with conditional branching and global variables

Authors:
R. J. Lipton
Affiliations:
-
Venue:
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Year:
1974

Citing 3
Cited 7

Synchronization of communicating processes

Communications of the ACM
The structure of the “THE”-multiprogramming system

Communications of the ACM
Programming semantics for multiprogrammed computations

Communications of the ACM

Synchronization Problems Solvable by Generalized PV Systems

Journal of the ACM (JACM)
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable

Journal of the ACM (JACM)
Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel program correctness through refinement

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An algebraic system for process structuring and interprocess communication

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Time-space trade-offs for asynchronous parallel models (Reducibilities and Equivalences)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Implementing semaphores by binary semaphores

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

A formal model of the process concept is presented. This model can represent sets of processes that use the synchronization primitive PV or one of the many generalizations of PV. The study of synchronization problems is then reduced to the study of relations between sets of processes. For one relation— “simulate”—it is possible to show that there are differences between several synchronization primitives. These differences show that the relative “power” of these synchronization primitives is not the same.