Re:Semaphores are surprisingly versatile
by kazinator on Monday March 16, 2015 @04:43PM
(#9214263)
> ... almost all synchronization primitives can be implemented with each other
Not to mention that any partial recursive function can be computed by a machine which can move along an unlimited tape, reading or writing a symbol, according to a handful of rules. :)
> And as you point out, the various mutex incarnations usually have an easier time of tracking ownership and debugging
Ownership, whether or not the owning thread died, deadlock detection, recursion detection ... priority inversion handling like priority inheritance ...
Not to mention that any partial recursive function can be computed by a machine which can move along an unlimited tape, reading or writing a symbol, according to a handful of rules. :)
> And as you point out, the various mutex incarnations usually have an easier time of tracking ownership and debugging
Ownership, whether or not the owning thread died, deadlock detection, recursion detection ... priority inversion handling like priority inheritance ...