Comparative Study of Intelligent Scheduling Algorithms for Heterogeneous Systems | ||||
| IJCI. International Journal of Computers and Information | ||||
| Article 4, Volume 11, Issue 1, January 2024, Page 30-43 PDF (759.26 K) | ||||
| Document Type: Original Article | ||||
| DOI: 10.21608/ijci.2023.213534.1114 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
Abla Saad Elsayed  1; osama Abdel Raouf2; Mohy Hadhoud3; Ahmed Kafafy4
| ||||
| 1Machine intelligence department, Faculty of AI, Menoufia university | ||||
| 2Machine intelligence Department Faculty of AI, Menoufia University | ||||
| 3Department of information technology, Faculty of computers and Information, Menofia University | ||||
| 4Operation research dept., faculty of computers and information, Menofia university | ||||
| Abstract | ||||
| Scheduling tasks in a heterogeneous computing environment can be a challenging problem due to the diverse range of hardware and software resources available. In this comparative study different approaches are investigated for solving multitask scheduling in the heterogeneous computing environment, reviewing the literature on the topic, highlighting the strengths and weaknesses of different scheduling algorithms. Then, formulate a hypothesis about how multitask scheduling can be optimized in a heterogeneous computing environment and design an experiment to test this hypothesis. This study experiment involves running a variety of scheduling algorithms as GRASP, Tabu Search, SA, GA, HEFT and FCFS on a heterogeneous computing platform. This study yields valuable insights on the efficacy of various optimization algorithms for scheduling problems and emphasizes the significance of selecting suitable algorithms based on the problem's specific features. The result of this study indicates that the GRASP algorithm outperforms other scheduling algorithms as HEFT Ranked up, Tabu Search, SA, GA, HEFT Ranked down, and FCFS, producing schedules with shorter completion times. This is a critical factor when evaluating scheduling algorithms. The exceptional performance of GRASP can be credited to its effective navigation of the solution space and its adept utilization of a blend of greedy constructive heuristics and randomized local search methods, which enable it to achieve top-notch solutions. Future studies can examine the suitability of the GRASP algorithm for other scheduling problems and explore methods to further improve its performance. Additionally, it is worth noting that GRASP has shown greater efficiency than other algorithms. | ||||
| Keywords | ||||
| Task Scheduling; Heterogeneous Computing Environment; Metaheuristics | ||||
|
Statistics Article View: 297 PDF Download: 296 |
||||
