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.


Year:
2006
Keywords:
Laboratories:




 Record created 2006-03-31, last modified 2018-11-26

n/a:
Download fulltext
PDF

Rate this document:

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