How Fast Reads Affect Multi-Valued Register Simulations

DOI10.1145/3293611.3331580OpenAlexW2963921206MaRDI QIDQ5145209FDOQ5145209

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

Recommendations

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

zbMATH Keywords

wait-freedomregister simulations

Mathematics Subject Classification ID

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

Cited In (2)

• How fast can a very robust read be?
• Title not available (Why is that?)

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)