Wait-free made fast
Yehuda Afek, Dalia Dauber, Dan Touitou · 1995
An implementationof an asynchronous shared-data structure is wait-free if no adversarial scheduler can stop an individual operation on the data structure from making progress (that is the implementation can tolerate a fail-stop fault of any number of processes).An implementation is non-blocking if an adversarial scheduler cannot stop the system from making progress.of the Assoc!abon of Computing Machinery.o cop otherwse, or to repubhsh, requires y '/' a fee ancf/or soecl IC oermisslon.STOC' 95, L& Veg&, Nevada, USA @ 1995 ACM 0-89791 -718-9/95/0005..$3.50 places the O(n) term of wait-free implementations with an O(k) term (or O(k~log f)).