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 ?

Algorithm, compound interest

compound interest

Computer architecture, #formular for calculating speed up factor fo super s...

#formular for calculating speed up factor fo super scalar architecture, super pipeline architecture and VLIW with m different functional units.

Printers, Printers: Printers: Printers exist in a variety of forms: ...

Printers: Printers: Printers exist in a variety of forms: Line Printers: These have been widely used for many years in large computer installations. They are design

Cisc, two characteristics og CISC architecture?

two characteristics og CISC architecture?

Networking.., write advantages and disadvantages of private and public netw...

write advantages and disadvantages of private and public network

Iterative deepening search-artificial intelligence, Iterative Deepening Sea...

Iterative Deepening Search- Artificial intelligence: So, breadth first search is guaranteed to find a solution (if one exists), but it grape whole memory. However, Depth first

Cpu, what is cpu

what is cpu

What is deadlock ?Differentiate two types of resources ?, • A set of proce...

• A set of process is in a deadlock state if each process in the group is waiting for an event that can be caused by only another process in the set. In other words, each member of

Example of autonomous rational agents, Example of autonomous rational agent...

Example of autonomous rational agents-Artificial intelligence The procedure of waste water treatment After the level of pollutants in waste water is find out, following 5

What is Semaphore and explain with example?, Description A semaphore is a...

Description A semaphore is a confined variable whose value can be accessed and changed only by the operations P and V and initialization operation known as ''Semaphoiinitislize''.

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