About The “Memory Barrier”
[Contains Manhua Spoilers]

seen from United Kingdom
seen from United States
seen from China

seen from United States
seen from Türkiye
seen from United States

seen from China

seen from Türkiye
seen from China
seen from Germany

seen from United Kingdom
seen from Türkiye
seen from China
seen from Germany

seen from Australia

seen from Türkiye
seen from United States
seen from China

seen from Estonia
seen from Germany
About The “Memory Barrier”
[Contains Manhua Spoilers]
Differences between Locks, Mutexes, and Semaphores
Differences between Locks, Mutexes, and Semaphores
James writes to me:
I’m having trouble finding concrete definitions for Locks, Mutexes, and Semaphores
What I do know is:
Semaphores keep track of how many processes have gained access (“P”) to a resource and block (suspend and send to priority queue) processes once it’s maxed out. They have no concept of ownership and anyone can call unlock (“V”)
Binary semaphores are the same as above except…
View On WordPress
Reading in either direction from this blog post was also pretty enlightening. It has good links, too~
This page on cppreference.com is surprisingly in-depth but some of the related pages are pretty vague and imo outright misleading.
Also vaguely instructive
Read through the annotated slides of a talk about the java memory model, apparently. No particular reason but now I'm reading about non-blocking algorithms.
Hint, its all about memory barriers.