Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks

Authors:
Colette Johnen;Lisa Higham
Affiliations:
LRI, Univ. Paris-Sud, CNRS, Orsay, France F-91405;Computer Science Department, University of Calgary, Canada
Venue:
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Year:
2009

Citing 8
Cited 1

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)
Distributed computing: fundamentals, simulations and advanced topics

Distributed computing: fundamentals, simulations and advanced topics
Self-stabilization of wait-free shared memory objects

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments

WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Wait-free regular storage from Byzantine components

Information Processing Letters
Relationships between communication models in networks using atomic registers

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Pragmatic self-stabilization of atomic memory in message-passing systems

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first wait-free and self-stabilizing implementation of a single-writer/single-reader regular register by single-writer/single-reader safe registers. The construction is in two steps: one implements a regular register using 1-regular registers, and the other implements a 1-regular register using safe-registers. In both steps, if the initial register is bounded then the implementation uses only bounded registers.