A note on atomicity: boosting Test\&Set to solve consensus

DOI10.1016/j.ipl.2009.02.004zbMath1209.68049OpenAlexW2148649726MaRDI QIDQ987831

Michel Raynal, Damien Imbs

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.004

zbMATH Keywords

fault-tolerancedistributed computingconcurrencydistributed computabilityconsensus numberprocess crash failureasynchronous shared memory systems

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition

Cites Work

• From adaptive renaming to set agreement
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems

This page was built for publication: A note on atomicity: boosting Test\&Set to solve consensus