The mutual exclusion problem: part I—a theory of interprocess communication
Journal of the ACM (JACM)
Communications of the ACM
ACM Transactions on Programming Languages and Systems (TOPLAS)
A new explanation of the glitch phenomenon
Acta Informatica
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
Concurrent control with “readers” and “writers”
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Introduction to VLSI Systems
Analyzing Specifications for Delay-Insensitive Circuits
ASYNC '98 Proceedings of the 4th International Symposium on Advanced Research in Asynchronous Circuits and Systems
ACM SIGACT news distributed computing column 13
ACM SIGACT News
Making Petri Nets Safe and Free of Internal Transitions
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
On Synchronous and Asynchronous Interaction in Distributed Systems
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Symmetric and Asymmetric Asynchronous Interaction
Electronic Notes in Theoretical Computer Science (ENTCS)
A Metastability-Free Multi-synchronous Communication Scheme for SoCs
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
VLSI implementation of a distributed algorithm for fault-tolerant clock generation
Journal of Electrical and Computer Engineering - Special issue on Clock/Frequency Generation Circuits and Systems
Constructive Boolean circuits and the exactness of timed ternary simulation
Formal Methods in System Design
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Making Petri Nets Safe and Free of Internal Transitions
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
| Hi-index | 0.00 |
Implementing traditional forms of multiprocess synchronization requires a hardware arbiter. Here, we consider what kind of synchronization is achievable without arbitration. Several kinds of simple arbiter-free registers are defined and shown to have equal power, and the class of synchronization problems solvable with such registers is characterized. More powerful forms of arbiter-free communication primitives are described. However, the problem of characterizing the most general form of arbiter-free synchronization remains unsolved.