Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive (2p-\lceil\frac{p}{k}\rceil) -Renaming Via k-Set Agreement

DOI10.1007/11864219_1MaRDI QIDQ3524290zbMATH OpenOpenAlexFDO

Authors Achour Mostefaoui, Michel Raynal, Corentin Travers

Publication date 9 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11864219_1

Mathematics Subject Classification ID

Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• From Renaming to Set Agreement
• From adaptive renaming to set agreement
• scientific article; zbMATH DE number 2006648
• Adaptive and efficient algorithms for lattice agreement and renaming
• Fully-adaptive algorithms for long-lived renaming

Cited in

(4)

• From adaptive renaming to set agreement
• On the weakest failure detector ever
• Generalized symmetry breaking tasks and nondeterminism in concurrent objects
• The renaming problem in shared memory systems: an introduction

This page was built for publication: Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement

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