Re:Linus Torvalds on semaphores (1999)
by kragen on Wednesday December 17, 2014 @01:09PM
(#8763410)
You can implement message passing, STM, BSP, data parallelism, etc., on top of spinlocks, or on top of other implementations of mutexes such as condition variables, or on top of semaphores; but you can also implement them on top of primitives like compare-and-swap, which is arguably even harder to use correctly.
[ Parent
| on HN ]
There are no comments on this comment yet.