Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
Constructing 1-writer multireader multivalued atomic variables from regular variables
Journal of the ACM (JACM)
On interprocess communication and the implementation of multi-writer atomic registers
Theoretical Computer Science
How to share concurrent wait-free variables
Journal of the ACM (JACM)
Self-stabilization
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Stabilization-preserving atomicity refinement
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Self-stabilization of wait-free shared memory objects
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Simple Wait-Free Multireader Registers
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Distributed Computing
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Fault-tolerant implementations of atomic registers by safe registers in networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Fault-tolerant implementations of the atomic-state communication model in weaker networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Hi-index | 0.00 |
A distributed system is commonly modelled by a graph where nodes represent processors and there is an edge between two processors if and only if they can communicate directly. In shared-registers versions of this general dcscription, neighbouring processors communicate by reading or writing shared registers, where each read or write is one atomic step. Variants of shared register models occur in the literature. This paper defined two models of shared registers determined by selecting the register locations. In the atomic-state model, each processor has a register; in the atomic-link model, each communication link has a register. We determine under what conditions and with what robustness and/or failure-tolerance guarantees it is possible to transform a solution under the atomic-state model into a solution under the atomic-link model. The fault-tolcrant models considered in this paper are wait-freedom and self-stabilization. These questions are addressed by first establishing a framework for defining correct transformations, which may be useful for similar studies of the relationship between various models of distributed computationl.