Sciweavers

WDAG
2005
Springer
80views Algorithms» more  WDAG 2005»
13 years 9 months ago
Obstruction-Free Algorithms Can Be Practically Wait-Free
Abstract. The obstruction-free progress condition is weaker than previous nonblocking progress conditions such as lock-freedom and waitfreedom, and admits simpler implementations t...
Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir...