Coordination without prior agreement

DOI10.1145/3087801.3087807MaRDI QIDQ5368980zbMATH OpenOpenAlexFDO

Authors Gadi Taubenfeld

Publication date 11 October 2017

Published in Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3087801.3087807

zbMATH Keywords

agreementshared memorymutual exclusionrenaminganonymous registermemory-anonymous algorithmsunnamed register

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• The renaming problem in shared memory systems: an introduction
• Computing with infinitely many processes
• Sharing is harder than agreeing
• Mutual exclusion in fully anonymous shared memory systems
• From Renaming to Set Agreement

Cited in

(11)

• Light-weight leases for storage-centric coordination
• A visit to mutual exclusion in seven dates
• Leader-based de-anonymization of an anonymous read/write memory
• Anonymous Shared Memory
• Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
• The computational structure of progress conditions and shared objects
• Oblivious Collaboration
• Rational coordination with no communication or conventions
• Mutual exclusion in fully anonymous shared memory systems
• Election in fully anonymous shared memory systems: tight space bounds and algorithms
• The epigenetic consensus problem

This page was built for publication: Coordination without prior agreement

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