Fast, long-lived renaming improved and simplified

DOI10.1007/3-540-61769-8_19MaRDI QIDQ6570924zbMATH OpenFDO

Authors Mark Moir, Juan Garay

Publication date 11 July 2024

Full work available at URL https://doi.org/10.1007/3-540-61769-8_19

Mathematics Subject Classification ID

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

Recommendations

• Wait-free algorithms for fast, long-lived renaming
• Fully-adaptive algorithms for long-lived renaming
• scientific article; zbMATH DE number 2006648
• Fully-Adaptive Algorithms for Long-Lived Renaming
• scientific article; zbMATH DE number 1696672

Cites work

• An axiomatic basis for computer programming
• Long-lived renaming made fast
• The asynchronous computability theorem for t-resilient tasks
• Using k-exclusion to implement resilient, scalable shared objects (extended abstract)
• Wait-free algorithms for fast, long-lived renaming

This page was built for publication: Fast, long-lived renaming improved and simplified

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