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 ?

Switching mechanisms , SWITCHING MECHANISMS: Switching mechanisms are ...

SWITCHING MECHANISMS: Switching mechanisms are techniques devised to send messages in many dinections at once and to ensure that these messages are received with a minimum of

Integers, what is the size of a void integer and what is it''s range

what is the size of a void integer and what is it''s range

Random reading and writing and Closing a fcb file, The 21H function and the...

The 21H function and the 22H function of the 21H interruption are the ones in charge of realizing the random readings and writings in that order. The random register number and the

What is vpn? list the different types of vpn, Question 1 What is routing? ...

Question 1 What is routing? Explain the principles of routing Question 2 Explain different types of server operations in Enterprise Networking Question 3 Briefly d

Pipelining concept, The easiest way to approach pipelining is to regard as...

The easiest way to approach pipelining is to regard as the three stage fetch, decode and execute instruction execution cycle outlined earlier. There are times during each of these

What is Shortest-Remaining-Time (SRT) Scheduling?, • The SRT is the preemp...

• The SRT is the preemptive complement of SJF and helpful in time-sharing environment. • In SRT scheduling, the process with the least estimated run-time to completion is run next,

Looping statement, Looping Statement:  The purpose of a loop structure is...

Looping Statement:  The purpose of a loop structure is to repeat certain tasks until some condition is satisfied. Several variations of a loop structure are available in each pro

Alternative approaches for acquiring software, Alternative approaches for a...

Alternative approaches for acquiring software: There are some alternative approaches for acquiring software. They are:  i)  'off the shelf' software package  ii)  'turnk

What are the Software interruptions, Software interruptions can be thoroug...

Software interruptions can be thoroughly activated by the assembler invoking the number of the preferred interruption with the INT instruction. The use of interruptions aids us in

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