Coordination without prior agreement

DOI10.1145/3087801.3087807zbMATH Open1380.68069OpenAlexW2737388943MaRDI QIDQ5368980FDOQ5368980

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

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

zbMATH Keywords

agreementshared memorymutual exclusionrenaminganonymous registermemory-anonymous algorithmsunnamed register

Mathematics Subject Classification ID

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

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
• Rational coordination with no communication or conventions
• The computational structure of progress conditions and shared objects
• Oblivious Collaboration
• 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)