12/31/2022 0 Comments C programming round robin scheduling![]() ![]() ![]() Every process in a cluster is assigned the same time slice depending on the weight of its cluster and its CPU service period. The proposed work starts by clustering the processes into clusters where each cluster contains processes that are similar in attributes (e.g., CPU service period, weights and number of allocations to CPU). In this paper, a modified version of the RR algorithm is introduced to combine the advantageous of favor short process and low scheduling overhead of RR for the sake of minimizing average waiting time, turnaround time and NCS. ![]() Round robin (RR) is the most common preemptive scheduling policy used in time-shared operating systems. Scheduling criteria (e.g., waiting time, turnaround time and number of context switches (NCS)) are used to compare CPU scheduling algorithms. CPU scheduling is the basic job within any operating system. Minimizing time cost in time-shared operating system is the main aim of the researchers interested in CPU scheduling. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |