3 ms·
Herlihy[1] has a general transformation to make any arbitrary algorithm wait free, so I think that the claim of novelty is a bit overblown. [1] The Art of Mul
by gpderetta 7y ago
Herlihy[1] has a general transformation to make any arbitrary algorithm wait free, so I think that the claim of novelty is a bit overblown.
[1] The Art of Multiprocessor Programming; I seem to have misplaced my copy so I can't reference chapter and verse.
- deleted 7y ago[deleted]
- DSingularity 7y agoYeah I remember it. Basically, compare-and-swap to enqueue an operation. In contention threads will cooperate to help threads finish operations. With this you bound the blocking and achieve wait-free concurrent operation.
- thekdude 7y agoI believe you are talking about chapter 6 section 4, page 130 of the Revised First edition