Round-Robin Scheduling in operating system-computer world Round-Robin Scheduling The round-robin(R-R Scheduling) Scheduling algorithm is designed for time sharing operating system. Round-Robin is similar to FCFS Scheduling, but preemption is added to enable the system to switch between processes. In Round-Robin Scheduling a small unit of time is used which is called a time quantum or time slice. A time quantum is generally from 10 to 100 millisecond. The CPU Scheduler goes around the ready queue, allocate the CPU to every process for a time interval of up to 1 time quantum. In this scheduling new processes are added to the tail of the ready queue. The CPU scheduler picks the first process from ready queue, set a timer after one time slice and dispatch the process. One of two things will happens. When a process have CPU burst of less the 1 time quantum. In this case the process itself release the CPU. If the CPU burst time of the currently runni...
Deadlock in operating system-computer world Deadlock : In a multi-programming environment, many process may complete for a minute number of resources. A process make a request for a resource and if the resource is not available at that time, the process enter In a waiting state. A waiting state process is never again-able to change state because the resource it has requested is held by other waiting process. This situation is called deadlock. So we can say that a process is said to be deadlock when it is waiting for an event or resources which will never occurs. so we can say that in this situation none of the process gets executed since the resource it needs, is held by some other process which is also waits for some other resource to be released. Let's assume that there are three process P1, P2, p3 and three different resources R1, R2 and R3. R1 is assigned to p1, R2 is assigned to P2 and R3 is assigned to P3. After somet...