February 2012
M T W T F S S
« Jan    
 12345
6789101112
13141516171819
20212223242526
272829  

Overview Of Mutual Exclusions in Operating Systems




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 [...]

August 25th, 2009 | Tags: , , , , , | Category: Algorithms, Deadlock, Mutual Exclusion, Resources | Leave a comment


Overview of Race Conditions in Operating Systems




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 [...]

August 25th, 2009 | Tags: , , , , , | Category: Deadlock, Race Conditions, Resources | Leave a comment


Deadlock – Algorithms




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 [...]

May 25th, 2008 | Category: Algorithms, Deadlock | Leave a comment


Deadlock avoidance and prevention




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 [...]

May 25th, 2008 | Category: Deadlock, Prevent | Leave a comment


 
  Older Entries »