Optimal multi-writer multi-reader atomic register

DOI10.1145/135419.135435zbMath1369.68053OpenAlexW2005421591MaRDI QIDQ5348836

Amos Israeli, Amnon Shaham

Publication date: 21 August 2017

Published in: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/5377

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14)

Related Items (9)

The time complexity of updating snapshot memories ⋮ How a rainbow coloring function can simulate wait-free handshaking ⋮ Linear-time snapshot implementations in unbalanced systems ⋮ Wait-free computing ⋮ Self-stabilization of wait-free shared memory objects ⋮ Finite-state concurrent programs can be expressed succinctly in triple normal form ⋮ Finite-state concurrent programs can be expressed in pairwise normal form ⋮ Concurrent Use of Write-Once Memory ⋮ Probabilistic quorum systems

This page was built for publication: Optimal multi-writer multi-reader atomic register