Vol.31, No.1, 2022, pp.581-590, doi:10.32604/iasc.2022.019928
OPEN ACCESS
ARTICLE
Scheduling Algorithm for Grid Computing Using Shortest Job First with Time Quantum
  • Raham Hashim Yosuf1, Rania A. Mokhtar2, Rashid A. Saeed2,*, Hesham Alhumyani2, S. Abdel-Khalek3
1 Electronics Engineering Department, Sudan University of Science and Technology, Khartoum, 1111, Sudan
2 Department of Computer Engineering, College of Computers and Information Technology, Taif University, P.O. Box 11099, Taif, 21944, Saudi Arabia
3 Department of Mathematics, College of Science, Taif University, P.O. Box 11099, Taif, 21944, Saudi Arabia
* Corresponding Author: Rashid A. Saeed. Email:
Received 02 May 2021; Accepted 05 June 2021; Issue published 03 September 2021
Abstract
The grid computing is one of the strong initiatives and technologies that has been introduced in the last decade for improve the resources utilization, optimization and provide very high throughput computation for wide range of applications. To attain these goals an effective scheduling for grid systems is a vital issue to realize the intended performance. The processes scheduling could be executed in various methods and protocols that have been extensively address in the literature. This works utilized shortest process first (SPF) protocol which gives the shortest jobs the highest priorities. For longer jobs, it should have lower priorities and wait in the queue longer time. With too many smallest tasks reach the queue, the long tasks can’t have an opportunity to be processed and the number of tasks continue growing in front of them, which is well-known issue called Starvations. In this work we introduce a new time quantum-based for shortest process first to avoid the starvation problem. The objective of the model is to optimize the utilization of resources by reducing end time of the job and enhancing performance of job scheduling. The model introduces fair treatment for all the processes. A simulation environment for the proposed model is developed and implemented. The results show that the quantum time-based solution has improved the starvation issues severely in terms of time delay, optimization of grid resources and fairness. The results show that SJF with time quantum outperform the SJF in terms of end time process, resources utilization, delay to transmission and Fair treatment for all the processes. But in term of waiting time Shortest Job First is better, SJF does not always minimize waiting time.
Keywords
Grid computing; scheduling; time quantum shortest process first
Cite This Article
Yosuf, R. H., Mokhtar, R. A., Saeed, R. A., Alhumyani, H., Abdel-Khalek, S. (2022). Scheduling Algorithm for Grid Computing Using Shortest Job First with Time Quantum. Intelligent Automation & Soft Computing, 31(1), 581–590.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.