The Weakest Failure Detectors to Boost Obstruction-Freedom

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 Omega*, a new failure detector which we introduce in this paper, and which is strictly weaker than <>P but strictly stronger than Omega, is the weakest to convert any obstruction-free algorithm into a non-blocking one.


Published in:
Proceedings of the 20th International Symposium on Distributed Computing (DISC'06), 399-412
Presented at:
20th International Symposium on Distributed Computing (DISC'06), Stockholm, Sweden, September 2006
Year:
2006
Laboratories:




 Record created 2006-09-22, last modified 2018-06-22

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)