Round robin techniques is one of the most popular scheduling algorithms but the problem with that is more context switches, more waiting time. And yes the response time is good in this case.

But what if we can have different time slices for different processes?

And are there any good modifications to the basic RR algorithm which applies to Distributed/ Parallel computing scenario.

Any suggestion in this regard will be very helpful.

Edit:

The scheduling should be done on the below environment

Online System with symmetric processing stations.

throughput, response time,

And approximate schedule

Similar questions and discussions