Skip to main content

Round-Robin Scheduling in operating system-computer world

 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 running process is longer then one time quantum, the will go off . A context will executed, and the process will be put at the tail of the ready queue. The CPU scheduler will the select the next process in the ready queue. The average waiting time under the R-R scheduling is long.  The performance of R-R scheduling is depends on the size the time quantum. In R-R scheduling algorithm, the operating system defines a time quantum. All the process will executed in the cyclic way each process will get the CPU for a small amount of time and then get back to the ready queue to wait for its next turn. The new process is added to the ready queue. Context switching is used to save the processes in PCB. Consider the following set of processes that arrive time 0, with the length of the CPU burst given in milliseconds.

Process                                    Burst Time

 P1                                                             24

 P3                                                              3

 P3                                                              3

In this case we use time quantum of 4 milliseconds, the process p1 gets the first 4 millisecond. Since it require another 20 milliseconds, it is permitted after the first time quantum, and the CPU is given to the next process ,process p2. Process p2 does not need 4 milliseconds, so it quits before it's time quantum expires. The CPU is given to the next process , process p3 once each process received 1 time quantum, the CPU return to the process p1. 

Let's calculate the average waiting time for this schedule. P1 wait for 6 millisecond (10-4), P2 wait for 4 millisecond, p3 wait for 7 millisecond. The average waiting time is 17/3 = 5.66 millisecond.



Comments

Post a Comment

Popular posts from this blog

Single partition allocation, Multiple-partition allocation and Fixed Equal-size partitions in operating system-computer world

  Single partition allocation, Multiple-partition allocation and Fixed Equal-size partitions in operating system Single partition allocation In this scheme operating system is residing in law memory and user process are executing in higher memory. Advantages It is simple  It is easy to understand and use Disadvantages User job is limited to the size of available memory. It leads to poor Utilization of processor and memory. Multiple-partition allocation  It is the simplest method for allocating  memory is divided memory into several fixed size partitions. Fixed Equal-size partitions It divides the main memory Into equal number of fixed sized partitions, operating system occupies some fixed portion and remaining portion of main memory is available for user processes. Advantages It supports multi programming. A process whose size is less then or equal to the partitions size can be loaded into any available partition. Disadvantages If a program is big to fit in...
Post a Comment
Read more

Memory in computer (primary, secondary and cache memory)-computer world

  Memory : A memory just like a human brain.It is used to store data and instructions. Computer memory is the storage space in the computer, where data is to be processed and instruction  required processing are stored. Computer memory is classified into following types : 1. Cache memory : Cache memory is a very high speed semiconductor memory which can speed up the CPU. It act as buffer(small storage are ) Between the CPU and main memory. We can say that it is a high speed memory between CPU and RAM and it is used temporary store very active data and instruction during processing.  2. Primary memory : Primary holds only that data and instruction on which the computer is currently working. Data holds by primary memory is lost when power is switched of. Primary is not fast as resisters. Primary is divided into two subcategory's : 1. RAM(Random access memory) : Random access memory is a form of computer memory that can be read and change in any any order typically ...
Post a Comment
Read more

Definition of computer cables and types of cables

Definition of computer cables and types of cables Definition  of computer cables : A cable is one or more wires which are covered in plastic that transmitter power or data between devices and computers. A cables is also known as cord, connector or plug. Data cables provides communication between devices for example DVD and HDMI, USB cables and Cat 5. A power cable is used for supply the power and electricity. Types of cables : There are many types of cables used in computer science some of them are given below : Coaxial cable Twisted cable Optical cable Coaxial cable :   It is consist of a central copper wire surrounded  by a copper mess.  Coaxial cables are used for transmitting data at high rate. Coaxial tables are used by telephone companies to transmit data because cables handle  up to 40000 telephone calls simultaneously. Coaxial  cables group of specially wrapped and insulated wires.   Twisted pair cab...
Post a Comment
Read more