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 ?

Communications programs , Communications Programs : By communications prog...

Communications Programs : By communications programs, we mean those programs which allow a computer to communicate via a transmission cable to another electronic device. Here we d

Cellular., explain?

explain?

Problem solving using a computer, PROBLEM SOLVING USING A COMPUTER The ...

PROBLEM SOLVING USING A COMPUTER The following steps are required for solving a problem using a computer system: Problem Definition Program Planning (Preparati

FEMAL. REPODUCATIVE. SYSTEM, Ask question #Minimum. Hello. ser can. y...

Ask question #Minimum. Hello. ser can. you. tell. me. that. what. is. the. batter. side. for. BIOLOGY. Students. from. class. 12. / xii. 100 words accepted#

Diskless workstations, Diskless workstations: Most people assume th...

Diskless workstations: Most people assume that the operating system is stored on a disk that is connected directly to the computer, but this is not necessarily true. If the

Types of mapping, draw associative mapping

draw associative mapping

Explain acl with its types, Question 1 Discuss the two basic operational c...

Question 1 Discuss the two basic operational characteristics of RR Only an active route is redistributed Route redistribution does not impact local route selection

Search strategies, Search strategies are evaluated along four main dimensio...

Search strategies are evaluated along four main dimensions. Name those dimensions and briefly describe each one

Software evolution, SOFTWARE EVOLUTION: As you know that in a compute...

SOFTWARE EVOLUTION: As you know that in a computer system both hardware and software complement each other - one is of hardly any use without the other. Hence, since the ve

Unix shell and history problem, UNIX Shell and History feature. 1.Creating ...

UNIX Shell and History feature. 1.Creating a child process. 2.Creating a history feature. Its exactly "programming project 1 - Unix Shell and History Feature (p.157-159)" in the Si

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