📄️ Process Synchronization Background
A system typically consists of several (perhaps hundreds or even thousands) of threads running either concurrently or in parallel. As we saw in the last chapter about threads, they share user data.
📄️ The Critical-Section Problem
To guard against the race condition previously discussed, we need to ensure that only one process at a time can be manipulating the variable count. To make such a guarantee, we require that the processes be synchronized in some way.
📄️ Mutex Locks
Operating-system designers build higher-level software tools to solve the critical-section problem. The simplest of these tools is the mutex lock.
📄️ Semaphores
Mutex locks, as mentioned earlier, are generally considered the simplest of synchronization tools. But sometimes we need a more robust tool that can also provide more sophisticated ways for processes to synchronize their activities.
📄️ Extra
Further Reading
🗃️ Problems
2 items