Round Robin Scheduling Algorithm to Control Processes that Grow Non-Deterministically

Scheduling is one of the most important fundamental concepts in operating systems. Round Robin (RR) scheduling is one of the most widely used algorithms in multitasking and real time environments [1]. In multitasks environments, it is necessary to select the process among a set of processes. The CPU is allocated to the selected process and controlled by the scheduling algorithm. Each scheduling algorithm has its own needs, advantages and disadvantages. In this paper we have studied RR and focused on Dynamic Round Robin algorithm (DRR) and its impact on the processes, which grow in its burst time in a non-deterministic way with different sets of phenomenon and compared the results.