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 ?

Internet, how to get tamil information in internet

how to get tamil information in internet

How to avoid race conditions with critical section?, • The key to preventi...

• The key to preventing problem involving shared storage is get some way to prohibit more than one process from reading and writing the shared data concurrently. That part of the p

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

Cryptography, Assume |s1|=|s2|=n and consider the functions defined, for an...

Assume |s1|=|s2|=n and consider the functions defined, for any s1 and s2, as: (a) G1(s1,s2)=s1 xor s2, (b) G2(s1,s2)=(s1, s2, s1 xor s2). We have that: A. G1 and G2 are pseudo-ra

Python Identifiers, A Python identifier is a name used for classify a funct...

A Python identifier is a name used for classify a function, variable, class, module or any other object. An identifier begins with a letter A to Z or a to z or an underscore (_) fo

Evolution of a computer, EVOLUTION OF A COMPUTER: Although 'computer',...

EVOLUTION OF A COMPUTER: Although 'computer', as we understand it today, is relatively of recent innovation, its development rests on centuries' of research. This section pres

Artificial interlligence, 7. Name and explain the action in Conceptual Depe...

7. Name and explain the action in Conceptual Dependency which refers to a transfer of possession.

Embedded operating systems, Embedded Operating Systems, Devices have EOS bu...

Embedded Operating Systems, Devices have EOS built-in, OPERATING SYSTEM embed on the System itself, Cell phones, PDAs, medical equipment Fast, Application specific Stable a

Science is scienceritic, 2*aC=

2*aC=

Computerised systems, Computerised Systems : You would have realized by no...

Computerised Systems : You would have realized by now that computing systems are most useful for manipulating information. Any organisation and management of information basically

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