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 ?

Why learning of Assembly language is beneficial?, The first reason to work ...

The first reason to work with assembler is that it offers the opportunity of knowing more the operation of your PC, which permits the development of software in a more constant man

Pep8, Write an Assembly program that reads an integer (-32,768 through 32,7...

Write an Assembly program that reads an integer (-32,768 through 32,767) in decimal and prints its equivalent in binary. The output must show all 16 bits. And you must use a loop

Basic computer organisation, Ask question #Minimum a 1000 words accepted#

Ask question #Minimum a 1000 words accepted#

CAI, what is CAI? explain its pitfalls.

what is CAI? explain its pitfalls.

Data communication , (iv) Suppose that the TCP entity receives a 1.5 megaby...

(iv) Suppose that the TCP entity receives a 1.5 megabyte file from the application layer and that the IP layer is willing to carry blocks of maximum size 1500 bytes. Calculate the

Immediate addressing, These addressing modes are: With immediate addressing...

These addressing modes are: With immediate addressing, no lookup of data is essentially required. The data is located in the operands of the instruction itself, not in a different

What is meant by clock skew and clock drift among clocks, QUESTION (a) ...

QUESTION (a) Describe what is meant by Clock Skew and Clock Drift among clocks in a distributed system. (b) A clock is reading 08:25:46.0 (hr:min:sec) when it is discovered

ICT, what are the significance of telecommunications deregulation

what are the significance of telecommunications deregulation

Java HW help, Need help with java hw

Need help with java hw

Output, what is output and input

what is output and input

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