A Proposed CPU Job-Scheduling Technique Based on Round Robin Method Using Dual Synchronized Time-Slices

A major aspect of distributed systems is task scheduling. How significant is it to adequately allocate tasks to each one of the computer's processors for the purpose of achieving better performance? The indicated approaches attempt to reduce costs and improve performance while maximizing the utilization of the central processing unit (CPU) in such a situation. The main flaw in such methods is that they require a lot of scheduling and, as a result, a lot of time. To address such a flaw, a modified CPU job-scheduling method was suggested, which used the Round Robin technique (R.R.) and dual synchronized time-slices to reduce jobs' waiting time to be executed. Therefore, the present study proves that the suggested approach has optimization efficiency with an average percentage of (12.4%–62.07%), according to an original R.R. algorithm.