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 ?

Geometric mean - algorithm, The geometric mean is obtained by multiplying a...

The geometric mean is obtained by multiplying all the four numbers and taking the fourth root of the product. Let x 1 ,x 2 ,x 3 and x 4 be the given four numbers then geometric

Logic unit, explain logic unit

explain logic unit

Explain briefly about das, Question 1 What is Content Addressable Storage?...

Question 1 What is Content Addressable Storage? Explain the elements of Content Addressable Storage Question 2 Explain briefly about DAS Question 3 Explain about N

Bus structure, which computer architecture use single bus structure??????? ...

which computer architecture use single bus structure??????? tells the name and little bit working

statistics, write a 2 page essay operational gaming and monte carlo simula...

write a 2 page essay operational gaming and monte carlo simulation

Algorithms, 1. In each of the following situations, indicate whether f = O...

1. In each of the following situations, indicate whether f = O(g), or f = O(g), or both (in which case f = T(g)). Briefly explain why. (a) f(n)=10n5 +8n2,g(n)=20n4 +7n3 +300 (b) f

Php, Which of the following is NOT a type of SQL constraint?

Which of the following is NOT a type of SQL constraint?

Example of flowcharting, Example of flowcharting: Example Problem s...

Example of flowcharting: Example Problem statement: To find out whether a given number is even or odd. Algorithm: Step 1 Start Step 2 INPUT the number n Step 3

Artificial intelligence-intelligence performanc of computer , "Just how are...

"Just how are we capable to get a computer to performe intelligent tasks?" One thing to answer the question is to tell that: Logic generate a science out of many forms of re

Problem occurs during pipelining , While pipelining can cruelly cut the tim...

While pipelining can cruelly cut the time taken to execute a program, there are troubles that cause it to not work as well as it possibly shall. The three stages of the instruction

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