how Round robin scheduling algorithm is useful than others ?, Basic Computer Science

how Round robin scheduling algorithm is useful than others ?, Basic Computer Science

Assignment Help:

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.

Related Discussions:- how Round robin scheduling algorithm is useful than others ?

Viewing pipeline, Short note on tjis topic

Short note on tjis topic

Outdoor patient department features - receptionist module, Outdoor Patient...

Outdoor Patient Department (OPD) Features The following modules can be developed for various areas and workers. A receptionist Module Receptionist updates all bas

What is Load and store the assembly programs?, It would not emerge practica...

It would not emerge practical to type an entire program each time it is required, and to avoid this it is possible to store a program on the disk, with the vast advantage that by b

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

Cryptography, Consider the one-time pad encryption scheme to encrypt a 1-bi...

Consider the one-time pad encryption scheme to encrypt a 1-bit message m, and assume m is chosen with uniform distribution from message space M={0,1}. Let E1 be the event "message

Evolution of a computer, EVOLUTION OF A COMPUTER: Although 'computer',...

EVOLUTION OF A COMPUTER: Although 'computer', as we understand it today, is relatively of recent innovation, its development rests on centuries' of research. This section pres

Artificial intelligence agents, Artificial Intelligence Agents In the ea...

Artificial Intelligence Agents In the earlier teach, we discussed what we will be talking about in Artificial Intelligence and why those tasks are important. This lecture is all

Algorithm, solve three given number in ascending order through algorithm

solve three given number in ascending order through algorithm

Execution of a machine instruction, Execution of a machine instruction: ...

Execution of a machine instruction: Execution of a machine instruction on modern processors involves a complex sequence of operations with multiple cycles. One instruction cyc

Traditional business cycle, what is traditional business cycle

what is traditional business cycle

Write Your Message!

Name

Email id

Message

Verfication Code

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

Submit Assignment

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd