3.8 Proceedings Paper

Multi Criteria based Resource Score Heuristic for Cloud Workflow Scheduling

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.procs.2020.01.099

Keywords

Directed Acyclic Graphs; Makespan; Reliability; Resource Availability; Workflow Scheduling

Ask authors/readers for more resources

Scheduling scientific workflows modelled by Directed Acyclic Graphs (DAG) is an NP complete problem. Cloud computing provides reliable Quality of Service defined in terms of Service Level Agreements (SLA). To schedule scientific workflows in cloud environment, where resources are shared, it is important to manage the cloud resources efficiently by maximizing utilization. The dynamic nature of cloud resources, due to sharing, heterogeneity, virtualization and workload variations offer a host of challenges in terms of resource availability and performance. This may have a significant impact on task execution times and data transfer times, thus introducing delay in overall execution time called makespan, In this paper, Multi Criteria based Resource Score Heuristic for Cloud Workflow Scheduling is proposed, with an objective of minimizing makespan considering the probability of temporal availability of resources in a cloud computing environment. To choose the best virtual machine with optimal value of maximum resource availability and minimum task execution time, a method of compensatory aggregation of conflicting criteria, is used for scoring each resource. The simulation results demonstrate that the proposed heuristic, can generate schedules with better makespan minimization and is found to be more reliable since resource availability factor is considered while mapping tasks to virtual machines. (C) 2019 The Authors. Published by Elsevier B.V.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

3.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available