A New Enhanced IGBTQ-based Model for CPU Scheduling

Research Article
Open access

A New Enhanced IGBTQ-based Model for CPU Scheduling

Ra’ed M. Al-Khatib 1 , Asef Al-Khateeb 2 , Esraa Al-Daom 3 , Ishraq T. Al-Dagamseh 4 , Ayat Tawalbeh 5 , Laith Abualigah 6*
  • 1 Yarmouk University    
  • 2 King Faisal University    
  • 3 Yarmouk University    
  • 4 Yarmouk University    
  • 5 Yarmouk University    
  • 6 Al al-Bayt University, Middle East University    
  • *corresponding author aligah.2020@gmail.com
Published on 1 August 2023 | https://doi.org/10.54254/2755-2721/8/20230207
ACE Vol.8
ISSN (Print): 2755-273X
ISSN (Online): 2755-2721
ISBN (Print): 978-1-915371-63-8
ISBN (Online): 978-1-915371-64-5

Abstract

CPU scheduling is concerned with how to efficiently exploit processors by executing the largest number of operations in the shortest possible time. The efficiency of CPU scheduling depends on the algorithm used. Round Robin (RR) is one of the most popular algorithms, which is primarily based on determining the period of execution time for the operation. In this work, we develop a new enhancement algorithm for modifying the RR algorithm based on IGBTQ model to solve the CPU scheduling problem. Therefore, the main objective is to improve the Average waiting Time (AWT) and the Average Turnaround Time (ATT). The final results are successful when reached the lowest scores of AWT and ATT measurements. The experiments used two cases of a different number of processes, which obtained better outputs compared to other state-of-the-art models like; the dynamic RR with Control Preemption (DRRCP), Group Based Time Quantum (GBTQ), and IGBTQ algorithm.

Keywords:

artificial Intelligence (AI), CPU scheduling, round robin, average waiting time, average turnaround time

Al-Khatib,R.M.;Al-Khateeb,A.;Al-Daom,E.;Al-Dagamseh,I.T.;Tawalbeh,A.;Abualigah,L. (2023). A New Enhanced IGBTQ-based Model for CPU Scheduling. Applied and Computational Engineering,8,411-417.
Export citation

References

[1]. S. Zouaoui, L. Boussaid, and A. Mtibaa, “Priority based round robin (PBRR) CPU scheduling algorithm.,” International Journal of Electrical \& Computer Engineering (2088-8708), vol. 9, no. 1, 2019.

[2]. S. M. Ali, R. F. Alshahrani, A. H. Hadadi, T. A. Alghamdi, F. H. Almuhsin, and E. E. El-Sharawy, “A Review on the CPU Scheduling Algorithms: Comparative Study,” IJCSNS, vol. 21, no. 1, p. 19, 2021.

[3]. H. M. Mijinyawa and S. E. Abdullahi, “Improved Group Based Time Quantum (IGBTQ) CPU scheduling algorithm,” in 2017 13th International Conference on Electronics, Computer and Computation (ICECCO), 2017, pp. 1–6.

[4]. D. Biswas and M. Samsuddoha, “Determining Proficient Time Quantum to Improve the Performance of Round Robin Scheduling Algorithm.,” International Journal of Modern Education \& Computer Science, vol. 11, no. 10, 2019.

[5]. S. Mostafa and H. Amano, “An adjustable round robin scheduling algorithm in interactive systems,” Information Engineering Express, vol. 5, no. 1, pp. 11–18, 2019.

[6]. A. Simon, S. Abdullahi, and S. Junaidu, “Dynamic Round Robin with Controlled Preemption (DRRCP),” International Journal of Computer Science Issues (IJCSI), vol. 11, no. 3, p. 109, 2014.

[7]. S. K. Panda, D. Dash, and J. K. Rout, “A group based time quantum round robin algorithm using min-max spread measure,” arXiv preprint arXiv:1403.0335, 2014.

Cite this article

Al-Khatib,R.M.;Al-Khateeb,A.;Al-Daom,E.;Al-Dagamseh,I.T.;Tawalbeh,A.;Abualigah,L. (2023). A New Enhanced IGBTQ-based Model for CPU Scheduling. Applied and Computational Engineering,8,411-417.

Data availability

The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.

Disclaimer/Publisher's Note

The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

About volume

Volume title: Proceedings of the 2023 International Conference on Software Engineering and Machine Learning

ISBN：978-1-915371-63-8(Print) / 978-1-915371-64-5(Online)
Editor：Anil Fernando, Marwan Omar
Conference website: http://www.confseml.org
Conference date: 19 April 2023
Series: Applied and Computational Engineering
Volume number: Vol.8
ISSN：2755-2721(Print) / 2755-273X(Online)

© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license. Authors who publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See Open access policy for details).

References

[1]. S. Zouaoui, L. Boussaid, and A. Mtibaa, “Priority based round robin (PBRR) CPU scheduling algorithm.,” International Journal of Electrical \& Computer Engineering (2088-8708), vol. 9, no. 1, 2019.

[2]. S. M. Ali, R. F. Alshahrani, A. H. Hadadi, T. A. Alghamdi, F. H. Almuhsin, and E. E. El-Sharawy, “A Review on the CPU Scheduling Algorithms: Comparative Study,” IJCSNS, vol. 21, no. 1, p. 19, 2021.

[3]. H. M. Mijinyawa and S. E. Abdullahi, “Improved Group Based Time Quantum (IGBTQ) CPU scheduling algorithm,” in 2017 13th International Conference on Electronics, Computer and Computation (ICECCO), 2017, pp. 1–6.

[4]. D. Biswas and M. Samsuddoha, “Determining Proficient Time Quantum to Improve the Performance of Round Robin Scheduling Algorithm.,” International Journal of Modern Education \& Computer Science, vol. 11, no. 10, 2019.

[5]. S. Mostafa and H. Amano, “An adjustable round robin scheduling algorithm in interactive systems,” Information Engineering Express, vol. 5, no. 1, pp. 11–18, 2019.

[6]. A. Simon, S. Abdullahi, and S. Junaidu, “Dynamic Round Robin with Controlled Preemption (DRRCP),” International Journal of Computer Science Issues (IJCSI), vol. 11, no. 3, p. 109, 2014.

[7]. S. K. Panda, D. Dash, and J. K. Rout, “A group based time quantum round robin algorithm using min-max spread measure,” arXiv preprint arXiv:1403.0335, 2014.

For authors
Guide for authors Policies for authors Aims and scope Subscription Open access policy
For editors
Policies for editors Editorial board
For reviewers
Policies for reviewers Privacy policy

Cookies are used by this site.
Copyright © 2024 EWA Publishing, its licensors, and contributors. All rights reserved, including text and data mining, AI training, and similar technologies.