Overview Of Mutual Exclusions in Operating Systems
Filed Under Algorithms, Deadlock, Mutual Exclusion, Resources | Posted on August 25, 2009
A way of making sure that if one process is using a shared modifiable data, the other processes will be excluded from doing the same thing. Formally, while one process executes the shared variable, all other processes desiring to do so at the same time moment should be kept waiting; when that process has finished [...]
Overview of Race Conditions in Operating Systems
Filed Under Deadlock, Race Conditions, Resources | Posted on August 25, 2009
A race condition happens when a system depends on something being done outside of its control before the system reaches a point where it needs to use the results of that something, and there’s no way to guarantee that that something will actually be finished when the system needs it. For example, suppose there’s a [...]
Deadlock – Algorithms
Filed Under Algorithms, Deadlock | Posted on May 25, 2008
BANKER’S ALGORITHM Consider an example: There are four customers: A, B, C and D, which are analogous to four processes. The credit unit is like the resource The banker himself is the OS Assume each credit unit = Rs. 1000. Not all customers need their maximum credit immediately. Hence only 10 credit units are reserved. [...]
Deadlock avoidance and prevention
Filed Under Deadlock, Prevent | Posted on May 25, 2008
Deadlock Prevention In order to prevent deadlock, the system is built in such a way that no deadlock occurs. Make sure that at least one of the four conditions in which deadlock can occur does not exist. Attacking Hold and wait : In order to ensure that hold and wait condition never occurs, two protocols [...]
