Re:Lock-free multithreading with atomic operations
by mehrdadn on Tuesday July 30, 2019 @06:55AM
(#20563649)
I love your last paragraph. It's extremely intuitive and yet I don't think I've ever seen it explained that way.
[ Parent
| on HN ]
Re:Lock-free multithreading with atomic operations
by vishnugupta on Tuesday July 30, 2019 @10:01AM
(#20564909)
Not to take anything away from the parent's thoughtful comment. That important property is, in fact, the definition of lock-free. Lock-free and wait-free (which has a stronger guarantee) algorithms are sub-classifications of non-blocking algorithms.
If I could recommend one book on this topic it'd be "The Art of Multiprocessor Programming". The authors have contributed to this subject through original research and make the topic quite approachable.
Re:Lock-free multithreading with atomic operations
by mehrdadn on Tuesday July 30, 2019 @01:47PM
(#20567289)
> Not to take anything away from the parent's thoughtful comment. That important property is, in fact, the definition of lock-free.
According to Wikipedia, it's the definition of non-blocking, not the definition of lock-free... which I guess is a correction for both the parent comment and yours. [1]
As far as I recall ever seeing, people always talk about it in terms of guaranteed systemwide progress, which I don't find as enlightening as what happens when you pause a thread.
Re:Lock-free multithreading with atomic operations
by MaxBarraclough on Tuesday July 30, 2019 @05:18PM
(#20569270)
A good article on this hierarchy (if you can forgive the low-contrast style):
http://concurrencyfreaks.blogspot.com/2013/05/lock-free-and-...
Re:Lock-free multithreading with atomic operations
by DSingularity on Tuesday July 30, 2019 @08:11AM
(#20564079)
If you like this kind of thing:
http://courses.cs.vt.edu/~cs5204/fall07-kafura/Papers/Transa...