Plain Round Robin(RR) algorithm

[mghaly]

Dear all,
I'm working on some kind of project, that I need to use plain round robin algorithm for processes scheduling. so please can anyone tell me what is the algorithm and include a flow chart describing it if available. Thank you.

 

[permute]

assume you have 3 processes:
1.) is process 1 ready to do something? if so, do process 1. go to #2
2.) is process 2 ready to do something? if so, do process 2. go to #3
3.) is process 3 ready to do something? if so, do process 3. go to #1


Thus, all processes have equal priority.

 

[seadolphine2000]

Each ready process will run for a fixed period of time called "Quantum".
Check this link for more information
Round-robin scheduling - Wikipedia, the free encyclopedia

 

[ckshivaram]

each task has specific time for execution time set in program. task2 executed for that much period. Once the time is over the other task3 is executes for its specified time limit. Once the time is over the other task1 is executes for its specified time limit.
Once the time is over the other task3 is executed for its specified time limit. any high priority task will interrupt task3 . once interrupt is over the task3 is executed from where it was stopped

 

[seadolphine2000]

any high priority task will interrupt task3 . once interrupt is over the task3 is executed from where it was stopped

The "Round Robin" scheduling by itself doesn't support priority scheduling. It is like the "First In First Out" scheduling algorithm, no priorities supported however, however you can mix it with some other priority support scheduling algorithms like the "Priority Inheritance" or "Priority Ceiling".

This part is quoted from Round-robin scheduling - Wikipedia, the free encyclopedia

Round-robin (RR) is one of the simplest scheduling algorithms for processes in an operating system, which assigns time slices to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive). Round-robin scheduling is both simple and easy to implement, and starvation-free.