Algorithms for mutual exclusion
Algorithms for mutual exclusion
The global time assumption and semantics for concurrent systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
On Lamport's interprocessor communication model
ACM Transactions on Programming Languages and Systems (TOPLAS)
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
The power of processor consistency
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
A Correctness Condition for High-Performance Multiprocessors
SIAM Journal on Computing
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Information and Computation
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
From Causal Consistency to Sequential Consistency in Shared Memory Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
On the composability of consistency conditions
Information Processing Letters
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A unified theory of shared memory consistency
Journal of the ACM (JACM)
Synchronous Byzantine quorum systems
Distributed Computing
Distributed Computing
Randomized registers and iterative algorithms
Distributed Computing
Tight Bounds for Critical Sections in Processor Consistent Platforms
IEEE Transactions on Parallel and Distributed Systems
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
IEEE Transactions on Computers
Quorum-based dynamic regular registers in systems with churn
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Dynamic regular registers in systems with churn
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Dynamic regular registers in systems with churn
Theoretical Computer Science
| Hi-index | 0.00 |
Regularity is a shared memory consistency condition that has received considerable attention. Lamport's original definition of regularity assumed a single-writer model, however, and is not well defined when the shared register may have multiple writers. In this paper, we consider four possible definitions of multiwriter regularity. The definitions are motivated by variations on a quorum-based algorithm schema for implementing them. We study the relationships between these definitions and a number of other well-known consistency conditions, and we give a partial order describing the relative strengths of these consistency conditions. Finally, we provide a practical context for our results by studying the correctness of two well-known algorithms for mutual exclusion under each of our proposed consistency conditions.