Brief announcement: Asynchronous coordination with constraints and preferences

DOI10.1145/2933057.2933081MaRDI QIDQ5361948zbMATH OpenOpenAlexFDO

Authors Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy

Publication date 29 September 2017

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

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

zbMATH Keywords

adaptive algorithmscoordinationdistributed algorithmgraph algorithmrenamingtaskwait-free computing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• Asynchronous coordination under preferences and constraints
• Brief announcement: There are plenty of tasks weaker than perfect renaming and stronger than set agreement
• Asynchronous exclusive selection
• Renaming in an asynchronous environment
• From Renaming to Set Agreement

Cited in

(1)

• Asynchronous coordination under preferences and constraints

This page was built for publication: Brief announcement: Asynchronous coordination with constraints and preferences

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