We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

Improvised Priority based Round Robin CPU Scheduling

by Kawser Irom Rushee, Kazi A. Kalpoma, Tahmina Akter
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 179 - Number 32
Year of Publication: 2018
Authors: Kawser Irom Rushee, Kazi A. Kalpoma, Tahmina Akter
10.5120/ijca2018916722

Kawser Irom Rushee, Kazi A. Kalpoma, Tahmina Akter . Improvised Priority based Round Robin CPU Scheduling. International Journal of Computer Applications. 179, 32 ( Apr 2018), 7-16. DOI=10.5120/ijca2018916722

@article{ 10.5120/ijca2018916722,
author = { Kawser Irom Rushee, Kazi A. Kalpoma, Tahmina Akter },
title = { Improvised Priority based Round Robin CPU Scheduling },
journal = { International Journal of Computer Applications },
issue_date = { Apr 2018 },
volume = { 179 },
number = { 32 },
month = { Apr },
year = { 2018 },
issn = { 0975-8887 },
pages = { 7-16 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume179/number32/29201-2018916722/ },
doi = { 10.5120/ijca2018916722 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:59:17.954586+05:30
%A Kawser Irom Rushee
%A Kazi A. Kalpoma
%A Tahmina Akter
%T Improvised Priority based Round Robin CPU Scheduling
%J International Journal of Computer Applications
%@ 0975-8887
%V 179
%N 32
%P 7-16
%D 2018
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper a new approach for Priority based round robin CPU scheduling algorithm is performed which improves the CPU performance in real time operating system. It retains the advantage of existing round-robin algorithms [5, 6, 8] and improves the performance. The proposed algorithm gives better performance with given priority as well as assigned priority and in both cases, minimize average waiting time which context switch number, and Average turnaround time from existing round robin algorithms. The paper gives a Graph comparative analysis of proposed algorithm with existing round robin scheduling algorithms on various cases with different combination of CPU burst varying time quantum, average waiting time, average turnaround time and number of context switches.

References
  1. Silberschatz, A., Peterson, J. L., and Galvin, B.,Operating System Concepts, Addison Wesley, 7th Edition, 2006.
  2. E.O. Oyetunji, A. E. Oluleye,” Performance Assessment of Some CPU Scheduling Algorithms”, Research Journal of Information Technology,1(1): pp 22-26, 2009.
  3. Englander, I., 2003. The Architecture of Computer Hardware and Systems Software; An Information Technology Approach, 3rd Edition,John Wiley & Sons, Inc.
  4. Yavatkar, R. and K . Lakshman,1995. A CPU Scheduling Algorithm for Continuous M edia Applications, In Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video, pp: 210-213.
  5. Abhishek Sirohi, Aseem Pratap, and Mayank Aggarwal, “Improvised Round Robin (CPU) Scheduling Algorithm”, International Journal of Computer Applications (0975 – 8887)Volume 99– No.18, August 2014.
  6. Ishwari Singh Rajput, Deepa Gupta,” A Priority based Round Robin CPU Scheduling Algorithm for Real Time Systems “,International Journal of Innovations in Engineering and Technology (IJIET)
  7. Ajit Singh, Priyanka Goyal, Sahil Batra,” An Optimized Round Robin Scheduling Algorithm for CPU Scheduling”, (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 07, 2383-2385, 2010. 9.
  8. Rakesh kumar yadav, Abhishek K Mishra, Navin Prakash, Himanshu Sharma,” An Improved Round Robin Scheduling Algorithm for CPU Scheduling”, (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 04, 1064-1066, 2010.
  9. William Stallings, Operating Systems Internal and Design Principles, 5th Edition , 2006.
  10. Saroj Hiranwal, K. C. Roy,” 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, July-December 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Round-Robin Context switch number Average waiting time Average turnaround time