Hire Our Expert Programmer & Technical Writer To Do Your Capstone Project
0 votes
in Compilers & Operating Systems by (user.guest)

1 Answer

0 votes
by (user.guest)
Firstly round robin algorithm is similar to that of FCFS first come first serve, meaning processes or jobs that arrive first get attended to first. This implies round robin follows a similar pattern, this though ensures fairness in execution. Round robin though gives shares of time in turns to processes, so this ensures that a process cannot run too long, and it will be preempted, thereby giving other process a chance to run. The preempted processes are usually taken to the back of the queue.

Related questions

+1 vote
1 answer
Welcome to CPENTalk.com

Disclaimer: Every user is solely responsible for anything that he/she posts or uploads on CPENTalk.