Dekker’s algorithm in Process Synchronization
This link explains about Dekker’s algorithm and there’s more than one version of it. It’s a new thing for me (mostly I read about Peterson’s solution) hence I chose this link.
Difference between racearound condition and deadlock
A discussion about difference between race condition and deadlock. I chose this link because I like the answers. The top answer gives and analogy as an example.
How to use POSIX semaphores in C language
An article about semaphore usage in C. Though it doesn’t give any explanation about POSIX or a link to another article about POSIX, I still chose this link because it gives an example along with the explanation.
Semaphores (Multithreaded Programming Guide)
A documentation about semaphores. It even explains the meaning of P and V operations. Kinda hard to read, but pretty useful to understand semaphore functions.
Mutex vs Semaphore
Basically FAQs about mutex and semaphore, and when to use which. I chose this link because it covers the general questions as well.
What is POSIX? Richard Stallman explains
A explanation of POSIX based on an interview(?). This link is interesting because some of the explanations written in a form of dialogue.
Peterson’s Algorithm for Mutual Exclusion
Peterson’s algorithm is a refined version of Dekker’s algorithm. I chose this link along with Dekker’s algorithm article.
Process Synchronization in Operating System
An explanation about process synchronization and other terms (critical section, race confition, etc.). It covers a lot of things but in a brief, easily-understood way.
Banker’s Algorithm in Operating System
Another algorithm aside from Dekker and Peterson’s, Banker’s algorithm is used to avoid deadlock conditions. I like reading about algorithms so I chose this link.
Test Set Lock Mechanism
An explanation about TSL. I found this link when GSGSing about synchronization and it’s something new for me so I chose this link.