Are lock-free concurrent algorithms practically wait-free?

DOI10.1145/2591796.2591836MaRDI QIDQ6829231zbMATH OpenFDO

Authors Dan Alistarh, Keren Censor-Hillel, Nir Shavit

Publication date 26 June 2015

Published in Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

zbMATH Keywords

distributed computinglockfree algorithmsprogress propertiesschedulersshared memorywait-free algorithms

Mathematics Subject Classification ID

Distributed systems (68M14) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

This page was built for publication: Are lock-free concurrent algorithms practically wait-free?

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