4 ms·
> Are you sure that you get rid of deadlocks? By definition, a lock-free algorithm guarantees at least one thread makes forward progress at each time step. So
by RossBencina 10y ago
> Are you sure that you get rid of deadlocks?
By definition, a lock-free algorithm guarantees at least one thread makes forward progress at each time step. So yes, there is no chance of deadlock.
If you want to guarantee that all threads make progress per unit time, you need wait-free.
- MichaelMoser123 10y agothere is the lock-free circular buffer, where the buffer is linear and the indexes are atomic variables; now once the buffer is full, the indexes act like locks - the producer can't insert anything unless the consumer removes entries, now the 'locks' have the crucial role in maintaining the data structure. what am i missing?