Debugging Parallel Programs with Instant Replay
IEEE Transactions on Computers
A protocol for wait-free, atomic, multi-reader shared variables
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Bounds for Mutual Exclusion with only Processor Consistency
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Simple Wait-Free Multireader Registers
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Distributed Computing
Tight Bounds for Critical Sections in Processor Consistent Platforms
IEEE Transactions on Parallel and Distributed Systems
A challenge for atomicity verification
Science of Computer Programming
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Concurrent reading while writing II: The multi-writer case
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Errata to "Atomic shared register access by asynchronous hardware," FOGS '86
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Agreement and consistency without knowing the number of processes
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Fault-tolerant semifast implementations of atomic read/write registers
Journal of Parallel and Distributed Computing
Reconfigurable distributed storage for dynamic networks
Journal of Parallel and Distributed Computing
Evaluating a Dependable Sharable Atomic Data Service on a Planetary-Scale Network
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Time and space optimal implementations of atomic multi-writer register
Information and Computation
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Tight failure detection bounds on atomic object implementations
Journal of the ACM (JACM)
Iterative computations with ordered read-write locks
Journal of Parallel and Distributed Computing
The disagreement power of an adversary
DISC'09 Proceedings of the 23rd international conference on Distributed computing
The failure detector abstraction
ACM Computing Surveys (CSUR)
Linearizable implementations do not suffice for randomized distributed computation
Proceedings of the forty-third annual ACM symposium on Theory of computing
The space complexity of long-lived and one-shot timestamp implementations
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Lower Bounds for Randomized Consensus under a Weak Adversary
SIAM Journal on Computing
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Restricted stack implementations
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Proving atomicity: an assertional approach
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Reconfigurable distributed storage for dynamic networks
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Relaxed synchronization with ordered read-write locks
Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing
From unreliable objects to reliable objects: the case of atomic registers and consensus
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
The space complexity of unbounded timestamps
DISC'07 Proceedings of the 21st international conference on Distributed Computing
The Space Complexity of Long-Lived and One-Shot Timestamp Implementations
Journal of the ACM (JACM)
| Hi-index | 0.00 |
The contribution of this paper is two-fold. First, we describe two ways to construct multivalued atomic n-writer n-reader registers. The first solution uses atomic 1-writer 1-reader registers and unbounded tags. the other solution uses atomic 1-writer n-reader registers and bounded tags. The second part of the paper develops a general methodology to prove atomicity, by identifying a set of criteria which guaranty an effective construction for the required atomic mapping. We apply the method to prove atomicity of the two implementations for atomic multiwriter multireader registers.