Cost minimization of scheduling scientific workflow applications on clouds. (10th September 2019)

• Record Type: Journal Article
• Authors: Wu, Hao; Chen, Xin; Song, Xiaoyu; Guo, He
• Is Part Of: Concurrency and computation. Volume 32:Number 5(2020)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2019-09-10
• Subjects: computer cloud -- cost minimization -- instance hours -- satisfiability modulo theories; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.5503
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Workflow scheduling with minimum cost is one of the most challenging problems for the users who need to execute a large‐scale scientific application on a cloud platform. However, traditional methods are hard to cover the highly complex applications and ignore the billing model of the public clouds. In this paper, we address the problem of scheduling a scientific application on cloud platform from the perspective of users. First, we propose a Satisfiability Modulo Theories (SMT) based algorithm to schedule a scientific application on cloud platform, the SMT algorithm constructs the scheduling problem to first‐order logic expressions and checks the expressions by solvers, which minimizes the number of Virtual Machine instances (VMs) allocated to the application. Furthermore, due to the hourly payment of cloud, we develop a heuristic algorithm called Multiple Strategies Algorithm (MSA) which determines the minimum instance hours of a scientific application deployed on VMs. At last, we combine the proposed SMT based algorithm and the MSA to a framework named SMT‐MSA, and compare it with other outstanding algorithms in experiments, the results show that, in most of cases, our algorithms reduce more cost than the other three methods which are HEFT, MSMD and IC‐PCPD2.