How Fast Reads Affect Multi-Valued Register Simulations

DOI10.1145/3293611.3331580MaRDI QIDQ5145209zbMATH OpenOpenAlexFDO

Authors Soma Chaudhuri, Reginald Frank, Jennifer L. Welch

Publication date 20 January 2021

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

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

zbMATH Keywords

register simulationswait-freedom

Mathematics Subject Classification ID

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

Recommendations

• Bounds on the Costs of Multivalued Register Implementations
• On the power of multiple reads in a chip
• scientific article; zbMATH DE number 176775
• scientific article; zbMATH DE number 793876
• Algorithms – ESA 2004

Cited in

(2)

• scientific article; zbMATH DE number 176775 (Why is no real title available?)
• How fast can a very robust read be?

This page was built for publication: How Fast Reads Affect Multi-Valued Register Simulations

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