Abstract Central Processing Unit (CPU) is the most significant resource and its scheduling is one of the main functions of an operating system. In timeshared systems, Round Robin (RR) is most widely used scheduling algorithm. The efficiency of RR algorithm is influenced by the quantum time, if quantum is small, there will be overheads of more context switches and if quantum time is large, then given algorithm will perform as First Come First Served (FCFS) in which there is more risk of starvation. In this paper, a new CPU scheduling algorithm is proposed named as Amended Dynamic Round Robin (ADRR) based on CPU burst time. The primary goal of ADRR is to improve the conventional RR scheduling algorithm using the active quantum time notion. Quantum time is cyclically adjusted based on CPU burst time. We evaluate and compare the performance of our proposed ADRR algorithm based on certain parameters such as, waiting time, turnaround time etc. and compare the performance of our proposed algorithm. Our numerical analysis and simulation results in MATLAB reveals that ADRR outperforms other well-known algorithms such as conventional Round Robin, Improved Round Robin (IRR), Optimum Multilevel Dynamic Round Robin (OMDRR) and Priority Based Round Robin (PRR).

References

[1] Aggarwal H., “Comparative Performance Study RI &38 6FKHGXOLQJ $OJRULWKPV´International Journal of Advanced Research in Computer Science and Software Engineering, vol. 4, no. 6, pp. 714-717, 2014.

[2] Behera H., Mohanty R., and Nayak D., “A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and its Performance Analysis,” International Journal of Computer Science and Communication, vol. 5, no. 5, pp. 10-15, 2010.

[3] Banerjee P., Banerjee P., and Dhal S., “Comparative Performance Analysis of Average Max Round Robin Scheduling Algorithm using Dynamic Time Quantum with Round Robin Scheduling Algorithm using Static Time Quantum,” International Journal of Innovative Technology and Exploring Engineering, vol. 1, no. 3, pp. 56-62, 2012.

[4] Chavan S., and P., and Tikekar., “An Improved Optimum Multilevel Dynamic Round Robin Scheduling Algorithm,” International Journal of 58.5853.36 45.2440.96 33.76 0 10 20 30 40 50 60 RR PRR OMDRR IRR ADRR Time (ms) RR PRR OMDRR IRR ADRR A Novel Amended Dynamic Round Robin Scheduling Algorithm for Timeshared Systems 97 Scientific and Engineering Research, vol. 4, no. 12, pp. 298-301, 2013.

[5] Dawood A., “Improving Efficiency of Round Robin Scheduling Using Ascending Quantum And Minumim-Maxumum Burst Time,” Journal of University of Anbar for Pure Science, vol. 6, no. 2, 2012.

[6] Goel N. and Garg R., “A Comparative Study of CPU Scheduling Algorithms,” International Journal of Graphics and Image Processing, vol. 2, no. 4, pp. 245-251, 2012.

[7] Hiranwal S. and Roy K.,“Adaptive Round Robin Scheduling using Shortest Burst Approach Based on Smart Time Slice,” International Journal of Computer Science and Communication, vol. 2, no. 2, pp. 319-323, 2011.

[8] Kumar A., Rohal H., and Arya S., “Analysis of CPU Scheduling Policies through Simulation,” International Journal of Advanced Research in Computer Science and Software Engineering, vol. 3, no. 5, pp. 1158-1162, 2013.

[9] Khan M., Hyder S., Ahmad G., and Begum S., “A Group Based Fault Tolerant Scheduling Mechanism to Improve the Application Turnaround Time on Desktop Grids,” The International Arab Journal of Information Technology, vol. 13, no. 2, pp. 274-280, 2016.

[10] Matarneh R., “Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Processes,” American Journal of Applied Sciences, vol. 6, no. 10, pp. 1831-1837, 2009.

[11] Mishra M. and Rashid F., “An Improved Round Robin Cpu Scheduling Algorithm with Varying Time Quantum,” International Journal of Computer Science, Engineering and Applications, vol. 4, no. 4, pp. 1-8, 2014.

[12] Noon A., Kalakech A., and Kadry S., “A New Round Robin Based Scheduling Algorithm for Operating Systems : Dynamic Quantum Using the Mean Average,” International Journal of Computer Science, vol. 8, no. 3, pp. 224-229, 2011.

[13] Panda S., Dash D., and Rout J., “A Group based Time Quantum Round Robin Algorithm using Min-Max Spread Measure,” International Journal of Computer Applications, vol. 64, no. 10, pp. 1-7, 2013.

[14] Panda S. and Bhoi S., “An Effective Round Robin Algorithm using Min-Max Dispersion Measure,” International Journal on Computer Science and Engineering, vol. 4, no. 1, pp. 45-53, 2012.

[15] Rajput I. and Gupta D., “A Priority Based Round Robin CPU Scheduling Algorithm for Real Time Systems,” International Journal of Innovations in Engineering and Technology, vol. 1, no. 3, pp. 1- 11, 2012.

[16] Singh P., Singh V., and Pandey A., “Analysis and Comparison of CPU Scheduling Algorithms,” International Journal of Emerging Technology and Advanced Engineering, vol. 4, no. 1, pp. 91- 95, 2014.

[17] Singh V. and Gabba T., “Comparative Study of Processes Scheduling,” International Journal of Computing and Business Research, vol. 4, no. 2, 2013.

[18] Singh A., Goyal P., and Batra S., “An Optimized Round Robin Scheduling Algorithm for CPU Scheduling,” International Journal on Computer Science and Engineering, vol. 2, no. 7, pp. 2383- 2385, 2010.

[19] Shyam R. and Nandal S., “Improved Mean Round Robin with Shortest Job First Scheduling,” International Journal of Advanced Research in Computer Science and Software Engineering, vol. 4, no. 7, pp. 170-179, 2014.

[20] Somani J. and Chhatwani P., “Comparative Study of Different CPU Scheduling Algorithms,” International Journal of Computer Science and Mobile Computing, vol. 2, no. 11, pp. 310-318, 2013

[21] Varma P., “A Best Possible Time Quantum for Improving Shortest Remaining Burst Round Robin Algorithm,” International Journal of Advanced Research in Computer Science and Software Engineering, vol. 2, no. 11, pp. 228- 237, 2012.

[22] Varma P., “Improved Shortest Remaining Burst Round Robin Using RMS as its Time Quantum,” International Journal of Advanced Research in Computer Engineering and Technology, vol. 1, no. 8, pp. 60-64, 2012.

[23] Yadav R., Mishra A., Prakash N., and Sharma H., “An Improved Round Robin Scheduling Algorithm for CPU Scheduling,” International Journal on Computer Science and Engineering, vol. 2, no. 4, pp. 1064-1066, 2010. 98 The International Arab Journal of Information Technology, Vol. 17, No. 1, January 2020 Uferah Shafi holds a BSc degree in Mathematics from Bahauddin Zikariya University, Multan, Pakistan and MSc degree in Information Technology from Quaid-i-Azam University, Islamabad, Pakistan and MS in Computer Science from COMSATS Institute of Information Technology, Islamabad, Pakistan. Her research interests include in pattern recognition and in field of AI. Currently she is doing research and development in Unicorn Black. Munam Shah received B.Sc and M.Sc degrees, both in Computer Science from University of Peshawar, Pakistan, in 2001 and 2003 respectively. He completed his MS degree in Security Technologies and Applications from University of Surrey, UK, in 2010, and has passed his PhD from University of Bedfordshire, UK in 2013. Since July 2004, he has been a Lecturer, Department of Computer Science, COMSATS University Islamabad, Pakistan. His research interests include MAC protocol design, QoS and security issues in wireless communication systems. Dr. Shah received the Best Paper Award of the International Conference on Automation and Computing in 2012. Dr. Shah is the author of more than 120 research articles. Abdul Wahid is Assistant Professor in the Department of Computer Science, CIIT. He has completed Ph.D from Kyungpook National University, Rep of Korea. His research interests include but are not limited to Vehicular Ad-hoc Network, Wireless Sensor Network, Underwater Wireless Sensor Network, Cyber Physical Systems, Software defined Networking, Information-centric Networking. Kamran Abbasi holds a PhD degree in Computer Science from UK and currently serving as Associate Professor at University of Sindh Pakistan, his key research areas are Operating Systems, Computer Networks, Information Systems and Educational Technology. Qaisar Javaid is working as an Assistant Professor in the Department of Computer Science & Software Engineering at IIUI. He is consistently doing research in the areas of Computer Networks, Information Security, Cloud Computing and IoT. He is also heading the CISCO Networking Academy of International Islamic University, Islamabad, Pakistan. Muhammad Asghar is serving as an Assistant Professor at Bahauddin Zakariya University Multan. His research interests include video content retrieval and video processing. Muhammad Haider graduated from Quaid-i-Azam University Islamabad, Pakistan. Currently, he is working as a software developer. His research interests are in reverse engineering and AI.