Round robin (RR) is one of the simplest, oldest, fairest and most extensively used algorithms.
• In the round robin scheduling, processes are posted in a FIFO manner but are given a limited amount of CPU time known as a time-slice or a quantum.
• If a process does not complete previous to its CPU-time expires, the CPU is preempted and given to the next process waiting in a queue. The preempted process is then positioned at the back of the ready list.
• Round Robin Scheduling is preemptive (at the end of time-slice) consequently it is effective in time-sharing environments in which the system needs to assurance reasonable response times for interactive users.
• The only interesting matter with round robin scheme is the length of the quantum. Putting the quantum too short causes too many context switches and lower the CPU competence. Conversely, setting the quantum too long may cause poor response time and approximates FCFS.
• In any occurrence, the average waiting time under round robin scheduling is often fairly long.

Posted Date: 5/2/2012 8:10:31 AM | Location : United States

Ask an Expert

Related Discussions:- how Round robin scheduling algorithm is useful than others ?, Assignment Help, Ask Question on how Round robin scheduling algorithm is useful than others ?, Get Answer, Expert's Help, how Round robin scheduling algorithm is useful than others ? Discussions

Write discussion on how Round robin scheduling algorithm is useful than others ?
Your posts are moderated

Write your message here..

Related Questions

C language, parent and child process using c language parent and child process using c language

Explain the probability and non-probability sampling methods, Question 1 W... Question 1 Write a program to read four floating point numbers and find their sum and average. Question 2 Differentiate string constants and character constants with one exam

Unspecified bit rate, ATM Theory - Unspecified Bit Rate Is intended for no... ATM Theory - Unspecified Bit Rate Is intended for non-real time applications, that is, those not requiring tightly constrained delay and delay variation. Examples of applications

Keystroke logger and data-stealing, Keystroke logger and Data-stealing: ... Keystroke logger and Data-stealing: Keystroke loggers: This is a program, once installed on the system, which intercepts the keys when entering the password or the Credit Ca

Output options to various multimedia, The various systems (computer, softwa... The various systems (computer, software and output devices) that are available have different limitations for output that is cartographic in nature. Some systems are CAD, GIS limit

Web browser, Web Browser:   A Web browser is software application that ... Web Browser:   A Web browser is software application that enables you to find, retrieve, and display information available on the World Wide Web (WWW). Browser also allows you

Explain different types of attacks, Question 1 Explain synchronous and asy... Question 1 Explain synchronous and asynchronous Data Replication Question 2 Write a short note on Access Time, Latency, Transfer Time, and Streaming Tape Question 3

What is evaluating information system investments, 1. What is Evaluating In... 1. What is Evaluating Information System Investments? 2. Is IS evaluation different to evaluation of other investments? 3. What approaches are used to evaluate IS investments

Explain ring counter with diagrams, Question 1 Convert the following hexad... Question 1 Convert the following hexadecimal numbers to base 2 (D73)16 (A21)16 Question 2 Convert the following binary numbers to base 16 (11001011)2 (11

C, What is a Structure? What is a Structure?