Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)

DOI10.1145/197917.197950zbMath1373.68191OpenAlexW2010113170MaRDI QIDQ5361392

Shlomo Moran, Hagit Brit

Publication date: 29 September 2017

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

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

Mathematics Subject Classification ID

Data structures (68P05) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (2)

On real-time and non real-time distributed computing ⋮ Public data structures: counters as a special case.

This page was built for publication: Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)