TY - GEN
T1 - Crash resilient and pseudo-stabilizing atomic registers
AU - Dolev, Shlomi
AU - Dubois, Swan
AU - Gradinariu Potop-Butucaru, Maria
AU - Tixeuil, Sébastien
N1 - Funding Information:
The research of the first author has been supported by the Ministry of Science and Technology, the Institute for Future Defense Technologies Research named for the Medvedi, Shwartzman and Gensler Families, the Israel Internet Association, the Lynne and William Frankel Center for Computer Science at Ben-Gurion University, Rita Altura Trust Chair in Computer Science, Israel Science Foundation (grant number 428/11), Cabarnit Cyber Security MAGNET Consortium and MAFAT. The research of the other authors has been supported in part by ANR project SHAMAN.
PY - 2012/12/1
Y1 - 2012/12/1
N2 - We propose a crash safe and pseudo-stabilizing algorithm for implementing an atomic memory abstraction in a message passing system. Our algorithm is particularly appealing for multi-core architectures where both processors and memory contents (including stale messages in transit) are prone to errors and faults. Our algorithm extends the classical fault-tolerant implementation of atomic memory that was originally proposed by Attiya, Bar-Noy, and Dolev (ABD) to a stabilizing setting where memory can be initially corrupted in an arbitrary manner. The original ABD algorithm provides no guaranties when started in such a corrupted configuration. Interestingly, our scheme preserves the same properties as ABD when there are no transient faults, namely the linearizability of operations. When started in an arbitrarily corrupted initial configuration, we still guarantee eventual yet suffix-closed linearizability.
AB - We propose a crash safe and pseudo-stabilizing algorithm for implementing an atomic memory abstraction in a message passing system. Our algorithm is particularly appealing for multi-core architectures where both processors and memory contents (including stale messages in transit) are prone to errors and faults. Our algorithm extends the classical fault-tolerant implementation of atomic memory that was originally proposed by Attiya, Bar-Noy, and Dolev (ABD) to a stabilizing setting where memory can be initially corrupted in an arbitrary manner. The original ABD algorithm provides no guaranties when started in such a corrupted configuration. Interestingly, our scheme preserves the same properties as ABD when there are no transient faults, namely the linearizability of operations. When started in an arbitrarily corrupted initial configuration, we still guarantee eventual yet suffix-closed linearizability.
KW - Atomic Register
KW - Fault-Tolerance
KW - Pseudo-Stabilization
UR - http://www.scopus.com/inward/record.url?scp=84871665126&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-35476-2_10
DO - 10.1007/978-3-642-35476-2_10
M3 - Conference contribution
AN - SCOPUS:84871665126
SN - 9783642354755
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 135
EP - 150
BT - Principles of Distributed Systems - 16th International Conference, OPODIS 2012, Proceedings
T2 - 16th International Conference on Principles of Distributed Systems, OPODIS 2012
Y2 - 18 December 2012 through 20 December 2012
ER -