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 ?

Cg, function of electrostatic plotter

function of electrostatic plotter

Completeness in search - artificial intelligence, Completeness in search - ...

Completeness in search - artificial intelligence: It's also importance trying to calculate the number of solutions to a problem, and the density of those solutions amongst the

What is a socket, QUESTION (a) You have been asked to design and implem...

QUESTION (a) You have been asked to design and implement a chat application. Which protocol would you used TCP or UDP? Justify your answer. (b) Explain why multithreading is

Computer input, COMPUTER INPUT: Figure shows input information for a ty...

COMPUTER INPUT: Figure shows input information for a typical airborne digital computer.  The sensors in Figure develop analogue electrical signals representing: -

Define Shortest-Job-First (SJF) Scheduling ?, • It is also known as Shortes...

• It is also known as Shortest-Process-Next (SPN). • Shortest-Job-First (SJF) is a non-preemptive order in which waiting job (or process) with the smallest predictable run-time-to-

Courier company , disvange and advantege of providing intternet sservice to...

disvange and advantege of providing intternet sservice to customer

Cad cam, Define explicit, implicit and parametric representation and what a...

Define explicit, implicit and parametric representation and what are their advantages?

Architecture, explain how modern computers conform to john von nuemann''s a...

explain how modern computers conform to john von nuemann''s architeture?

Use photoshop to create the images, Use the skills that you have learned in...

Use the skills that you have learned in Photoshop to create the following images that could be used in your upcoming web project. All images should be cohesive and complement each

DBMS, what is the meaning of data definition

what is the meaning of data definition

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