Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability

Oksana Denysyuk, Philipp Woelfel. Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability. In Yoram Moses, editor, Distributed Computing - 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings. Volume 9363 of Lecture Notes in Computer Science, pages 60-74, Springer, 2015. [doi]

Abstract

Abstract is missing.