Sign In
scheduling
Round Robin Scheduling
Submitted by inder on Sat, 17/01/2009 - 11:26.
RR (Round Robin) is One of the oldest, simplest, fairest and most widely used algorithm.The round-robin(RR) scheduling algorithm is designed especially for time-sharing systems. A small unit of time, called a time quantum or time-slice is defined. A time quantum is generally from 10 to 100 milliseconds. The ready queue is treated as a circular queue. The CPU scheduler goes around the ready queue, allocating the CPU to each process for a time interval of up to 1 time quantum.
Schedule Algorithms
Submitted by inder on Sat, 17/01/2009 - 11:06.
Based on nature of scheduling algorithm i.e. preemptive and non preemptive we have following algorithms for scheduling(Switching CPU between processes).
- FCFS Scheduling
- Round Robin Scheduling
- SJF Scheduling
- SRT Scheduling
- Priority Scheduling
- Multilevel Queue Scheduling
- Multilevel Feedback Queue Scheduling
Each of scheduling algorithm has its own advantages and disadvantages.
Preemptive Vs Nonpreemptive Scheduling
Submitted by inder on Sat, 17/01/2009 - 10:59.
The Scheduling algorithms can be divided into two categories with respect to how they deal with clock interrupts.
CPU Scheduling and process scheduling
Submitted by inder on Sat, 17/01/2009 - 10:28.
A multiprogramming operating system allows more than one process to be loaded into the executabel memory at a time and for the loaded process to share the CPU using time-multiplexing.Part of the reason for using multiprogramming is that the operating system itself is implemented as one or more processes, so there must be a way for the operating system and application processes to share the CPU. Another main reason is the need for processes to perform I/O operations in the normal course of computation.
