Separating Lock-Freedom from Wait-Freedom

DOI10.1145/3212734.3212739MaRDI QIDQ5197665zbMATH OpenOpenAlexFDO

Authors Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin

Publication date 19 September 2019

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

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

zbMATH Keywords

concurrencylock-freedommulti-core algorithmsnonblockingshared memorywait-freedom

Mathematics Subject Classification ID

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

Recommendations

• Wait-freedom is harder than lock-freedom under strong linearizability
• Deadlock and lock freedom in the linear -calculus
• Nested, but separate: isolating unrelated critical sections in real-time nested locking
• scientific article; zbMATH DE number 1418469
• Deadlock-free channels and locks
• Deadlock-freedom in resource contentions
• Deadlock-freedom-by-design, multiparty asynchronous global programming
• scientific article; zbMATH DE number 1693513
• Deadlock-freedom in component systems with architectural constraints
• scientific article; zbMATH DE number 88949

Cited in

(3)

• Wait-freedom is harder than lock-freedom under strong linearizability
• Nested, but separate: isolating unrelated critical sections in real-time nested locking
• Locally solvable tasks and the limitations of valency arguments

This page was built for publication: Separating Lock-Freedom from Wait-Freedom

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