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 ?

Explain the role of it in bpr, Question 1. Explain the levels of managemen...

Question 1. Explain the levels of management? Question 2. What are the advantages and disadvantages of DBMS Question 3. What are the advantages and disadvantages o

Many to many relationships, Each Many to Many relationship type maps into t...

Each Many to Many relationship type maps into the Table. The primary key of this relevant is the combination of the primary keys of the participating entity types. These are also c

Spidering or web crawling, Spidering or Web crawling: Spider or Web c...

Spidering or Web crawling: Spider or Web crawler is a computer program that browses the web pages of WWW in a systematic, automated manner. Search Engines use spider for gett

Computer architecture, speed up factor for superscalar architecture

speed up factor for superscalar architecture

Differentiate Preemptive and Nonpreemptive Scheduling?, The Scheduling algo...

The Scheduling algorithms can be divided into two parts with respect to how they deal with clock interrupts. 1) Nonpreemptive Scheduling: A scheduling

Telecommunications standards, TELECOMMUNICATIONS STANDARDS: They are d...

TELECOMMUNICATIONS STANDARDS: They are defined internationally by the CCITT (Consultative Committee for International Telegraphy and Telephones), but to deal with the rapidly

Types of operating systems, Operating Systems: An operating system is a se...

Operating Systems: An operating system is a set of programs that manage computer hardware resources and provide common services for application software. There are following kind

Motion estimation , motion estimation

motion estimation

Basic description of a computer system, The main components of a computer ...

The main components of a computer system at a basic level Computer System We call computer system to the whole configuration of a computer, as well as the peripheral units and the

Register array, #queA register is a memory location surrounded by the CPU i...

#queA register is a memory location surrounded by the CPU itself, designed to be rapidly accessed for purposes of fast data retrieval. Processors normally hold a register array, wh

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