Herlihy[1] has a general transformation to make any arbitrary algorithm wait fre... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		gpderetta on Nov 7, 2019 \| parent \| context \| favorite \| on: CX: Wait-Free Universal Construction 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.

thekdude on Nov 8, 2019 | [–]

I believe you are talking about chapter 6 section 4, page 130 of the Revised First edition

DSingularity on Nov 7, 2019 | | [–]

Yeah 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.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact