Efficient Prioritization and Processor Selection Schemes for HEFT Algorithm: A Makespan Optimizer for Task Scheduling in Cloud Environment
Cloud computing is one of the most commonly used infrastructures for carrying out activities using virtual machines known as processing units. One of the most fundamental issues with cloud computing is task scheduling. The optimal determination of scheduling criteria in cloud computing is a non-dete...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-08-01
|
| Series: | Electronics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2079-9292/11/16/2557 |
| _version_ | 1797410573457031168 |
|---|---|
| author | Sachi Gupta Sailesh Iyer Gaurav Agarwal Poongodi Manoharan Abeer D. Algarni Ghadah Aldehim Kaamran Raahemifar |
| author_facet | Sachi Gupta Sailesh Iyer Gaurav Agarwal Poongodi Manoharan Abeer D. Algarni Ghadah Aldehim Kaamran Raahemifar |
| author_sort | Sachi Gupta |
| collection | DOAJ |
| description | Cloud computing is one of the most commonly used infrastructures for carrying out activities using virtual machines known as processing units. One of the most fundamental issues with cloud computing is task scheduling. The optimal determination of scheduling criteria in cloud computing is a non-deterministic polynomial-time (NP)-complete optimization problem, and several procedures to manage this problem have been suggested by researchers in the past. Among these methods, the Heterogeneous Earliest Finish Time (HEFT) algorithm is recognized to produce optimal outcomes in a shorter time period for scheduling tasks in a heterogeneous environment. Literature shows that HEFT gives extraordinary results in terms of quality of schedule and execution time. However, in some cases, the average computation cost and selection of the first idle slot may not produce a good solution. Therefore, here we propose modified versions of the HEFT algorithm that can obtain improved results. In the rank generation phase, we implement different methodologies for calculating ranks, while in the processor selection phase, we modify the way of selecting idle slots for scheduling the tasks. This paper suggests enhanced versions of the HEFT algorithm under user-required financial constraints to minimize the makespan of a specified workflow submission on virtual machines. Our findings also suggest that enhanced versions of the HEFT algorithm perform better than the basic HEFT method in terms of lesser schedule length of the workflow problems running on various virtual machines. |
| first_indexed | 2024-03-09T04:32:09Z |
| format | Article |
| id | doaj.art-9c1cba1282834e3a89561153b9a11203 |
| institution | Directory Open Access Journal |
| issn | 2079-9292 |
| language | English |
| last_indexed | 2024-03-09T04:32:09Z |
| publishDate | 2022-08-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Electronics |
| spelling | doaj.art-9c1cba1282834e3a89561153b9a112032023-12-03T13:34:25ZengMDPI AGElectronics2079-92922022-08-011116255710.3390/electronics11162557Efficient Prioritization and Processor Selection Schemes for HEFT Algorithm: A Makespan Optimizer for Task Scheduling in Cloud EnvironmentSachi Gupta0Sailesh Iyer1Gaurav Agarwal2Poongodi Manoharan3Abeer D. Algarni4Ghadah Aldehim5Kaamran Raahemifar6Department of Information Technology, IMS Engineering College, Ghaziabad 201015, IndiaDepartment of Computer Science & Engineering, Rai School of Engineering, Rai University, Ahmedabad 382260, IndiaDepartment of Computer Science & Engineering, IMS Engineering College, Ghaziabad 201015, IndiaDivision of Information and Computing Technology, College of Science and Engineering, Hamad Bin Khalifa University, Doha 500001, QatarDepartment of Information Technology, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi ArabiaDepartment of Information Systems, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi ArabiaCollege of Information Sciences and Technology, Data Science and Artificial Intelligence Program, Penn State University, State College, PA 16801, USACloud computing is one of the most commonly used infrastructures for carrying out activities using virtual machines known as processing units. One of the most fundamental issues with cloud computing is task scheduling. The optimal determination of scheduling criteria in cloud computing is a non-deterministic polynomial-time (NP)-complete optimization problem, and several procedures to manage this problem have been suggested by researchers in the past. Among these methods, the Heterogeneous Earliest Finish Time (HEFT) algorithm is recognized to produce optimal outcomes in a shorter time period for scheduling tasks in a heterogeneous environment. Literature shows that HEFT gives extraordinary results in terms of quality of schedule and execution time. However, in some cases, the average computation cost and selection of the first idle slot may not produce a good solution. Therefore, here we propose modified versions of the HEFT algorithm that can obtain improved results. In the rank generation phase, we implement different methodologies for calculating ranks, while in the processor selection phase, we modify the way of selecting idle slots for scheduling the tasks. This paper suggests enhanced versions of the HEFT algorithm under user-required financial constraints to minimize the makespan of a specified workflow submission on virtual machines. Our findings also suggest that enhanced versions of the HEFT algorithm perform better than the basic HEFT method in terms of lesser schedule length of the workflow problems running on various virtual machines.https://www.mdpi.com/2079-9292/11/16/2557cloud computingNP-completetask schedulingHEFT |
| spellingShingle | Sachi Gupta Sailesh Iyer Gaurav Agarwal Poongodi Manoharan Abeer D. Algarni Ghadah Aldehim Kaamran Raahemifar Efficient Prioritization and Processor Selection Schemes for HEFT Algorithm: A Makespan Optimizer for Task Scheduling in Cloud Environment Electronics cloud computing NP-complete task scheduling HEFT |
| title | Efficient Prioritization and Processor Selection Schemes for HEFT Algorithm: A Makespan Optimizer for Task Scheduling in Cloud Environment |
| title_full | Efficient Prioritization and Processor Selection Schemes for HEFT Algorithm: A Makespan Optimizer for Task Scheduling in Cloud Environment |
| title_fullStr | Efficient Prioritization and Processor Selection Schemes for HEFT Algorithm: A Makespan Optimizer for Task Scheduling in Cloud Environment |
| title_full_unstemmed | Efficient Prioritization and Processor Selection Schemes for HEFT Algorithm: A Makespan Optimizer for Task Scheduling in Cloud Environment |
| title_short | Efficient Prioritization and Processor Selection Schemes for HEFT Algorithm: A Makespan Optimizer for Task Scheduling in Cloud Environment |
| title_sort | efficient prioritization and processor selection schemes for heft algorithm a makespan optimizer for task scheduling in cloud environment |
| topic | cloud computing NP-complete task scheduling HEFT |
| url | https://www.mdpi.com/2079-9292/11/16/2557 |
| work_keys_str_mv | AT sachigupta efficientprioritizationandprocessorselectionschemesforheftalgorithmamakespanoptimizerfortaskschedulingincloudenvironment AT saileshiyer efficientprioritizationandprocessorselectionschemesforheftalgorithmamakespanoptimizerfortaskschedulingincloudenvironment AT gauravagarwal efficientprioritizationandprocessorselectionschemesforheftalgorithmamakespanoptimizerfortaskschedulingincloudenvironment AT poongodimanoharan efficientprioritizationandprocessorselectionschemesforheftalgorithmamakespanoptimizerfortaskschedulingincloudenvironment AT abeerdalgarni efficientprioritizationandprocessorselectionschemesforheftalgorithmamakespanoptimizerfortaskschedulingincloudenvironment AT ghadahaldehim efficientprioritizationandprocessorselectionschemesforheftalgorithmamakespanoptimizerfortaskschedulingincloudenvironment AT kaamranraahemifar efficientprioritizationandprocessorselectionschemesforheftalgorithmamakespanoptimizerfortaskschedulingincloudenvironment |