The synchronization power of atomic bitwise operations

DOI10.4230/LIPICS.OPODIS.2015.26MaRDI QIDQ5363817zbMATH OpenOpenAlexFDO

Authors Damien Imbs

Publication date 29 September 2017

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2016/6615/pdf/LIPIcs-OPODIS-2015-26.pdf/

zbMATH Keywords

asynchronous systemsbinary operationsconsensusconsensus numberread/write shared memoryshared objectssynchronizationwait-freedom

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Generic proofs of consensus numbers for abstract data types
• Reliable synchronization in distributed systems
• Space-efficient asynchronous consensus without shared memory initialization
• Sharing is harder than agreeing
• Impossibility of distributed consensus with one faulty process

This page was built for publication: The synchronization power of atomic bitwise operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363817)