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 [...]
Effort estimation techniques
Filed Under Algorithms, Development, Model, Requirements, Resources, Software, Techniques | Posted on August 10, 2008
A new project is being thought of (or even an extension of the current product). As an example, say you want to build a new shopping cart application for your website. In order to get started, besides knowing exactly what you want to build (the product details), you also need to start estimating how many [...]
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. [...]
