New answers tagged

0

You probably cannot do much better than quote the abstract of Herlihy's original paper: A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a wait-free implementation of ...


Top 50 recent answers are included