Qu'est-ce que « Lock-free, wait-free » ?

An algorithm is lock-free if, whatever the scheduling of the threads, some thread completes its operation in a finite number of its own steps: a thread that stalls cannot stop the others. It is wait-free if every thread completes its operation in a bounded number of its own steps, whatever the others do (Herlihy, 1991).