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 ?

Digital wireless telephone networks, Mobile telephone networks started with...

Mobile telephone networks started with analog technology. Analog cellular networks were known as first generation (1G) networks. Such networks had limited capacity, and were subjec

Algorithm - programming language, Algorithm : Once a problem has been defi...

Algorithm : Once a problem has been defined precisely, a procedure or process must be designed to produce the required output from the given input. Since a computer is a machine t

Syntax of a Procedure in assembly language, There are two kinds of procedur...

There are two kinds of procedures, the intrasegments, which are found on the similar segment of instructions and the inter-segments which can be stored on dissimilar memory segment

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

Discuss about the descriptor classes, Question 1 List down any six feature...

Question 1 List down any six features of a Smartphone Question 2 Give a brief note on a) Internal Flash Disk. b) Use of C++ in Symbian OS Question 3 What are the naming

Simulated annealing-artificial intelligence, Simulated Annealing One wa...

Simulated Annealing One way to answer the problem of local maxima and related problems like ridges and plateaux in hill climbing is to permit the agent to go downhill to some e

Classify computer system according to capacity, classify computer system ac...

classify computer system according to capacity. how they are different from computer according to the classification of technology.provide the comparative study also.

Display the item in red colour on a web page, QUESTION (a) Give the app...

QUESTION (a) Give the appropriate syntax to implement a Client-Side Image Map, specifying all possible attributes where required (b) List the benefits of using Cascading Sty

Describe FCFS Scheduling algorithm ?, FCFS algorithm also known as: • Firs...

FCFS algorithm also known as: • First-In-First-Out (FIFO) • Run-Until-Done • Run-to-Completion • Possibly, First-Come-First-Served algorithm is the easiest scheduling algorithm i

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