论文信息 - Practically Stabilizing Atomic Memory

Practically Stabilizing Atomic Memory

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.

[1] Shlomi Dolev,et al. Empire of colonies: Self-stabilizing and self-organizing distributed algorithm , 2009, Theor. Comput. Sci..

[2] Shlomi Dolev,et al. Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[3] Shlomi Dolev,et al. Safe and Eventually Safe: Comparing Self-stabilizing and Non-stabilizing Algorithms on a Common Ground , 2009, OPODIS.

[4] Hagit Attiya. Robust Simulation of Shared Memory: 20 Years After , 2010, Bull. EATCS.

[5] Hagit Attiya,et al. Sharing memory robustly in message-passing systems , 1990, PODC '90.

[6] Uri Abraham,et al. Self-stabilizing timestamps , 2003, Theor. Comput. Sci..

[7] Leslie Lamport,et al. The part-time parliament , 1998, TOCS.

[8] Lisa Higham,et al. Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks , 2009, ICDCN.

[9] Shlomi Dolev,et al. Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments , 2001, WSS.

[10] Amos Israeli,et al. Resource Bounds for Self-Stabilizing Message-Driven Protocols , 1997, SIAM J. Comput..

[11] Shlomi Dolev,et al. Spanders: distributed spanning expanders , 2010, SAC '10.