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, solve three given number in ascending order through algorithm

solve three given number in ascending order through algorithm

What is a tool bar?, Question 1 Write short notes on ...

Question 1 Write short notes on (a) Office Automatics System (b) Transaction Processing System Question 2 What is a too

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''.

Read only memory (rom), Read only memory (rom): The problem with RAM is...

Read only memory (rom): The problem with RAM is that its memory is volatile, i.e. it loses all its data when the power supply is removed. A non-volatile memory is a permanent

C, programm for fibonacci series

programm for fibonacci series

Explain the different types of addressing modes, Question 1 What are the d...

Question 1 What are the different stages of evolution of Computer Architecture? Explain in detail Question 2 What are the components of Instruction Set architecture? Discu

Flow decomposition technique to list the cycles, QUESTION (a) Consider ...

QUESTION (a) Consider the graph below, use the Flow Decomposition technique to list the cycles and paths produced. (b) Pr

Programs, creating programs in scheme

creating programs in scheme

Need a help, i am currently studying my computer science engineering 2nd yr...

i am currently studying my computer science engineering 2nd yr. i am unable to select what specification should i take please help me

Data structure, #question.a tree has 0 off springs at each node. if it had ...

#question.a tree has 0 off springs at each node. if it had a label L, what will be the maximum number of nodes that the tree can have. only an expression involving the number of no

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