@inproceedings{cc9c455248f6479e9abc1e60cbae0ad9,
title = "The weakest failure detectors to boost obstruction-freedom",
abstract = "This paper determines necessary and sufficient conditions to implement wait-free and non-blocking contention managers in a shared memory system. The necessary conditions hold even when universal objects (like compare-and-swap) or random oracles are available, whereas the sufficient ones assume only registers. We show that failure detector ◇P is the weakest to convert any obstruction-free algorithm into a wait-free one, and Ω*, a new failure detector which we introduce in this paper, and which is strictly weaker than ◇P but strictly stronger than Ω, is the weakest to convert any obstruction-free algorithm into a non-blocking one.",
author = "Rachid Guerraoui and Micha{\l} Kapa{\l}ka and Petr Kouznetsov",
year = "2006",
month = jan,
day = "1",
doi = "10.1007/11864219\_28",
language = "English",
isbn = "3540446249",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "399--412",
booktitle = "Distributed Computing - 20th International Symposium, DISC 2006, Proceedings",
note = "20th International Symposium on Distributed Computing, DISC 2006 ; Conference date: 18-09-2006 Through 20-09-2006",
}