Call for Paper - November 2022 Edition
IJCA solicits original research papers for the November 2022 Edition. Last date of manuscript submission is October 20, 2022. Read More

A Hybrid Round Robin Scheduling Mechanism for Process Management

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2020
Authors:
Khaji Faizan Ali, Abhijeet Marikal, Kakelli Anil Kumar
10.5120/ijca2020919851

Khaji Faizan Ali, Abhijeet Marikal and Kakelli Anil Kumar. A Hybrid Round Robin Scheduling Mechanism for Process Management. International Journal of Computer Applications 177(36):14-19, February 2020. BibTeX

@article{10.5120/ijca2020919851,
	author = {Khaji Faizan Ali and Abhijeet Marikal and Kakelli Anil Kumar},
	title = {A Hybrid Round Robin Scheduling Mechanism for Process Management},
	journal = {International Journal of Computer Applications},
	issue_date = {February 2020},
	volume = {177},
	number = {36},
	month = {Feb},
	year = {2020},
	issn = {0975-8887},
	pages = {14-19},
	numpages = {6},
	url = {http://www.ijcaonline.org/archives/volume177/number36/31139-2020919851},
	doi = {10.5120/ijca2020919851},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

Every process which runs in an operating system is processed through multiprogramming, by sharing the processor. Multiprogramming is a capability of the operating system to execute one or a lot of programs in a single processing machine. Multiprogramming's main objective is to optimize the use of CPUs, throughput and minimize average waiting time (AWT), the average turnaround time (ATT), average response time (ART) and the number of context switches (NOC). Multi-programming can be performed by several CPU scheduling algorithms. Most preferable scheduling algorithm among all is Round robin (RR). RR algorithm is mainly depended on time quantum which is stationary. Hence, the proposed work is new approach to the round-robin scheduling algorithm (RR algorithm) with an enhanced time quantum based algorithm. This enhancement of RR algorithm by using dynamic time quantum leads to minimize AWT, ATT, ART and NOC. This approach inherits the properties of Round robin, shortest job first (SJF) algorithm and first come first serve algorithm(FCFS). Therefore, the proposed algorithm is a hybrid round robin scheduling mechanism for process management (HYRR Mechanism). HYRR Mechanism is an innovative scheduling algorithm which reduces ATT, ART, AWT and NOC to the desired levels.

References

  1. Singh H., Sarin S.K., Patel A., Sen S. (2018) Performance Analysis of Hybrid CPU Scheduling Algorithm in Multi-tasking Environment. In: Bhattacharyya P., Sastry H., Marriboyina V., Sharma R. (eds) Smart and Innovative Trends in Next Generation Computing Technologies. NGCT 2017. Communications in Computer and Information Science, vol 828. Springer, Singapore
  2. T. Singh, D. K. Srivastava and A. Aggarwal, "A novel approach for CPU utilization on a multicore paradigm using parallel quicksort," 2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT), Ghaziabad, 2017, pp. 1-6. K.
  3. U. Chindalia, S. C.S., S. Chandrashekar and O. Sharma, "Real Time Application and CPU Utilisation Monitoring Tool," 2019 3rd International conference on Electronics, Communication and Aerospace Technology (ICECA), Coimbatore, India, 2019, pp. 1136-1140.
  4. H. B. Parekh and S. Chaudhari, "Improved Round Robin CPU scheduling algorithm: Round Robin, Shortest Job First and priority algorithm coupled to increase throughput and decrease waiting time and turnaround time," 2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication (ICGTSPICC), Jalgaon, 2016, pp. 184-187K.
  5. Yasin, A., Faraz, A., & Rehman, S. (2016). Prioritized Fair Round Robin Algorithm with Variable Time Quantum. In Proceedings - 2015 13th International Conference on Frontiers of Information Technology, FIT 2015 (pp. 314–319). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/FIT.2015.62.
  6. M. A. Alworafi, A. Dhari, A. A. Al-Hashmi, A. B. Darem and Suresha, "An improved SJF scheduling algorithm in cloud computing environment," 2016 International Conference on Electrical, Electronics, Communication, Computer and Optimization Techniques (ICEECCOT), Mysuru, 2016, pp. 208-212
  7. P. Pathak, P. Kumar, K. Dubey, P. Rajpoot and S. Kumar, "Mean Threshold Shortest Job Round Robin CPU Scheduling Algorithm," 2019 International Conference on Intelligent Sustainable Systems (ICISS), Palladam, Tamilnadu, India, 2019, pp. 474-478
  8. L. Jian, Y. Xing, L. Ke-zhong and Y. Zhi-tao, "Study on the fluency of one-way waterway transportation based on First Come First Served (FCFS) model," 2015 International Conference on Transportation Information and Safety (ICTIS), Wuhan, 2015, pp. 669-674.
  9. J. Teraiya and A. Shah, "Comparative Study of LST and SJF Scheduling Algorithm in Soft Real-Time System with its Implementation and Analysis," 2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI), Bangalore, 2018, pp. 706-711.
  10. R. Srujana, Y. M. Roopa and M. D. S. K. Mohan, "Sorted Round Robin Algorithm," 2019 3rd International Conference on Trends in Electronics and Informatics (ICOEI), Tirunelveli, India, 2019, pp. 968-971.
  11. A. Karapici, E. Feka, I. Tafa and A. Allkoçi, "The Simulation of Round Robin and Priority Scheduling Algorithm," 2015 12th International Conference on Information Technology - New Generations, Las Vegas, NV, 2015, pp. 758-758.doi: 10.1109/ITNG.2015.131
  12. M. Aijaz, R. Tariq, M. Ghori, S. W. Rizvi and E. F. Qazi, "Efficient Round Robin Algorithm (ERRA) using the Average Burst Time," 2019 International Conference on Information Science and Communication Technology (ICISCT), Karachi, Pakistan, 2019, pp. 1-5.
  13. Zhou, P., Zheng, Y., & Li, M. (2014). How long to wait? Predicting bus arrival time with mobile phone based participatory sensing. IEEE Transactions on Mobile Computing, 13(6), 1228–1241. https://doi.org/10.1109/TMC.2013.136
  14. Chandel, G. S., & Singh, P. K. (2014). International Journal of Advanced Research in Computer Science and Software Engineering. International Journal, 4(2), 62–70. Retrieved from http://www.ijarcsse.com/docs/papers/July2012/Volume_2_issue_7/V2I700161.pdf
  15. J. C. Palencia, M. G. Harbour, J. J. Gutiérrez and J. M. Rivas, "Response-Time Analysis in Hierarchically-Scheduled Time-Partitioned Distributed Systems," in IEEE Transactions on Parallel and Distributed Systems, vol. 28, no. 7, pp. 2017-2030, 1 July 2017.
  16. I. Ungurean and N. C. Gaitan, "Performance analysis of tasks synchronization for real time operating systems," 2018 International Conference on Development and Application Systems (DAS), Suceava, 2018, pp. 63-66doi: 10.1109/DAAS.2018.8396072
  17. M. Sacha, "Measuring the real-time operating system performance," Proceedings Seventh Euromicro Workshop on Real-Time Systems, Odense, Denmark, 1995, pp. 34-40

Keywords

Scheduling Algorithm, number of context switches, Process Management, Dynamic time Quantum.