A Levelized Multiple Workflow Heterogeneous Earliest Finish Time Allocation Model for Infrastructure as a Service (IaaS) Cloud Environment

Cloud computing, a superset of heterogeneous distributed computing, allows sharing of geographically dispersed resources across multiple organizations on a rental basis using virtualization as per demand. In cloud computing, workflow allocation to achieve the optimum schedule has been reported to be NP-hard. This paper proposes a Levelized Multiple Workflow Heterogeneous Earliest Finish Time (LMHEFT) model to optimize makespan in the cloud computing environment. The model has two phases: task prioritization and task allocation. The task prioritization phase begins by dividing workflows into the number of partitions as per the level attribute; after that, upward rank is employed to determine the partition-wise task allocation order. In the allocation phase, the best-suited virtual machine is determined to offer the lowest finish time for each task in partition-wise mapping to minimize the workflow task’s completion time. The model considers the inter-task communication between the cooperative workflow tasks. A comparative performance evaluation of LMHEFT has been conducted with the competitive models from the literature implemented in MATLAB, i.e., heterogeneous earliest finish time (HEFT) and dynamic level scheduling (DLS), on makespan, flowtime, and utilization. The experimental findings indicate that LMHEFT surpasses HEFT and DLS in terms of makespan 15.51% and 85.12% when varying the number of workflows, 41.19% and 86.73% when varying depth levels, and 13.74% and 80.24% when varying virtual machines, respectively. Further statistical analysis has been carried out to confirm the hypothesis developed in the simulation study by using normality tests, homogeneity tests, and the Kruskal–Wallis test.

Authors

Institutions

Publication Details

Journal
Algorithms
Published
2025-02-10
DOI
https://doi.org/10.3390/a18020099
Citations
2
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
2.97

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Levelized Multiple Workflow Heterogeneous Earliest Finish Time Allocation Model for Infrastructure as a Service (IaaS) Cloud Environment

Mahfooz Alam, Farheen Bano, Faraz Hasan, Mohammad Shahid et al.
2 citations
Algorithms
Distributed and Parallel Computing Systems
2.97
article

A Levelized Multiple Workflow Heterogeneous Earliest Finish Time Allocation Model for Infrastructure as a Service (IaaS) Cloud Environment

Mahfooz Alam, Farheen Bano, Faraz Hasan, Mohammad Shahid, Mohammad Sajid, Faisal Ahmad
article en
2 citations

Abstract

Cloud computing, a superset of heterogeneous distributed computing, allows sharing of geographically dispersed resources across multiple organizations on a rental basis using virtualization as per demand. In cloud computing, workflow allocation to achieve the optimum schedule has been reported to be NP-hard. This paper proposes a Levelized Multiple Workflow Heterogeneous Earliest Finish Time (LMHEFT) model to optimize makespan in the cloud computing environment. The model has two phases: task prioritization and task allocation. The task prioritization phase begins by dividing workflows into the number of partitions as per the level attribute; after that, upward rank is employed to determine the partition-wise task allocation order. In the allocation phase, the best-suited virtual machine is determined to offer the lowest finish time for each task in partition-wise mapping to minimize the workflow task’s completion time. The model considers the inter-task communication between the cooperative workflow tasks. A comparative performance evaluation of LMHEFT has been conducted with the competitive models from the literature implemented in MATLAB, i.e., heterogeneous earliest finish time (HEFT) and dynamic level scheduling (DLS), on makespan, flowtime, and utilization. The experimental findings indicate that LMHEFT surpasses HEFT and DLS in terms of makespan 15.51% and 85.12% when varying the number of workflows, 41.19% and 86.73% when varying depth levels, and 13.74% and 80.24% when varying virtual machines, respectively. Further statistical analysis has been carried out to confirm the hypothesis developed in the simulation study by using normality tests, homogeneity tests, and the Kruskal–Wallis test.

AlgorithmsVol. 18(2)
Aligarh Muslim University (IN), King Abdulaziz University (SA), Workday (United States) (US), GITAM University (IN)
King Abdulaziz University
Openalex Percentile: Top 10%
Distributed and Parallel Computing Systems
2.97
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.