Practically Stabilizing Atomic Memory

TL;DR

This paper introduces a self-stabilizing simulation method for atomic memory in asynchronous systems, capable of handling process crashes and using a novel bounded labeling scheme for arbitrary labels.

Contribution

It presents a new combinatorial construction of a bounded labeling scheme that supports arbitrary labels, enhancing atomic memory stabilization.

Findings

Supports crash-tolerance with majority of processes active

Works in asynchronous message-passing systems

Uses a novel labeling scheme for arbitrary labels

Abstract

A self-stabilizing simulation of a single-writer multi-reader atomic register is presented. The simulation works in asynchronous message-passing systems, and allows processes to crash, as long as at least a majority of them remain working. A key element in the simulation is a new combinatorial construction of a bounded labeling scheme that can accommodate arbitrary labels, i.e., including those not generated by the scheme itself.