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 ?

Explain the raster scan display system, Question 1 Explain boundary fill a...

Question 1 Explain boundary fill and flood fill polygon filling algorithm Question 2 Draw and explain the block diagram of typical workstation Question 3 Explain the ras

Moderns, Moderns: As it was explained earlier, communications channels...

Moderns: As it was explained earlier, communications channels can operate in either the Analog or digital mode. However, a given circuit can operate only in one mode not both

Assignment Help, How would you format while loops to fufill my project writ...

How would you format while loops to fufill my project write up?

Define Twisted Pair Cables , Twisted pair cables comes in two appearance :...

Twisted pair cables comes in two appearance : Unshielded twisted pair cable : UTP : UTP cables is the most common types of telecommunication medium used today. Its frequency range

Describe FCFS Scheduling algorithm ?, FCFS algorithm also known as: • Firs...

FCFS algorithm also known as: • First-In-First-Out (FIFO) • Run-Until-Done • Run-to-Completion • Possibly, First-Come-First-Served algorithm is the easiest scheduling algorithm i

Text, text graphics audio video

text graphics audio video

Nano programing, Nano programming using microcontrol and circuits

Nano programming using microcontrol and circuits

Ipx for lan, explain ipx for lan and spx

explain ipx for lan and spx

Turn-around, The term ‘page traffic’ describes

The term ‘page traffic’ describes

Write Your Message!

Captcha
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!

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