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 ?

#title., what is input and output device? explain meaning of input and outp...

what is input and output device? explain meaning of input and output devices

Soft computing, Defination of Propositionl logic Predicate logic genertic a...

Defination of Propositionl logic Predicate logic genertic algorithm Hybrid system Optimization Fuzzy system rules Fuzzy system application

Convert string to super ascii, A string S is said to be "Super ASCII", if i...

A string S is said to be "Super ASCII", if it contains the character frequency equal to their ascii values. String will contain only lower case alphabets (''''''''a''''''''-'''''''

Digital transmission, Digital Transmission: In digital transmission, w...

Digital Transmission: In digital transmission, wave patterns are translated into discrete bits and are separated by intervals. Bits (contraction for binary digits) are the sma

Web Design Project, Hello - What is the turn around time for a 6 page websi...

Hello - What is the turn around time for a 6 page website.

Define Shortest-Job-First (SJF) Scheduling ?, • It is also known as Shortes...

• It is also known as Shortest-Process-Next (SPN). • Shortest-Job-First (SJF) is a non-preemptive order in which waiting job (or process) with the smallest predictable run-time-to-

Database, how does one create a database in mysql

how does one create a database in mysql

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