First-Come-First-Served (FCFS) Scheduling
Filed Under Algorithms, Benefits, FCFS | Posted on August 25, 2009
First-Come-First-Served algorithm is the simplest scheduling algorithm is the simplest scheduling algorithm. Processes are dispatched according to their arrival time on the ready queue. Being a non-preemptive discipline, once a process has a CPU, it runs to completion. The FCFS scheduling is fair in the formal sense or human sense of fairness but it is [...]
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 [...]
