In a multiprogramming environment, the Scheduling technique decides which process will be selected and assigned to the CPU next so that the efficiency of the CPU can be increased. One of the well-known techniques of scheduling is round-robin technique. A number of modifications have been made in the basic round robin scheduling algorithm but still work is going on to make it the ideal one. The performance of this technique mainly depends upon the selected value of time quantum i.e. a fair share of time for which a process can get the CPU and if the process still not completed, it will join the ready queue for completion of the remaining task. For achieving this aim, this paper proposed a new mode based round-robin scheduling algorithm that offers the reduction of average turnaround time as compared to average turnaround time calculated by existing modulus based technique, a best reported similar technique available in the literature. Experimental evaluation is done using C language.

CPU Scheduling, Scheduling Algorithm, Round-Robin Scheduling, Turnaround-Time, Time-Quantum

[1] S. Arif, S. Rehman, F. Riaz, “Design of A Modulus Based Round Robin Scheduling Algorithm”, 9th Malaysian Software Engineering Conference, pp. 230-235, Dec. 2015.
[2] M. Ghazizadeh and M. Naghibzadeh et al., “Fuzzy Round Robin CPU Scheduling (FRRCS) algorithm”, International Conference on Systems, Computing Sciences and Software Engineering (SCSS), Part of the International Joint Conferences on Computer, Information and Systems Sciences and Engineering, pp: 348-353, 2007.
[3] R. Matarneh, “Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Processes”, American Journal of Applied Sciences, pp. 1831-1837, 2009.
[4] A. Singh et. al., “An Optimized Round Robin Scheduling Algorithm for CPU Scheduling”, International Journal on Computer Science and Engineering, Vol. 02, No. 07, pp. 2383-2385, 2010.
[5] R. Mohanty, H. Behera, K. Patwari et al. "Design and Performance Evaluation of a New Proposed Shortest Remaining Burst Round Robin (SRBRR) Scheduling Algori thm"
[6] A. Noon, A. Kalakech, S. Kadry, "A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average ", IJCSl lnternational Journal of Computer Science, Issues, Vol. 8, Issue 3, No. I,2011.
[7] B. Alam, M. Doja, R. Biswas,“Finding Time Quantum of Round Robin CPU Scheduling Algorithm Using Fuzzy Logic”, International Conference on Computer and Electrical Engineering, pp. 795-798, 2008.
[8] N. Kumar, A. Kumar, “A Task set Based Adaptive Round Robin (TARR) scheduling algorithm for improving performance”, 1st International conference on futuristic trend in computational analysis and knowledge management, pp. 347-352, 2015.