Amazing technological breakthrough possible @S-Logix

Office Address

  • #5, First Floor, 4th Street Dr. Subbarayan Nagar Kodambakkam, Chennai-600 024 Landmark : Samiyar Madam
  • +91- 81240 01111

Social List

Deadline-constrained Cost Optimization Approaches for Workflow Scheduling in Clouds - 2017

Deadline-constrained Cost Optimization Approaches for Workflow Scheduling in Clouds

Research Area:  Cloud Computing


Nowadays it is becoming more and more attractive to execute workflow applications in the cloud because it enables workflow applications to use computing resources on demand. Meanwhile, it also challenges traditional workflow scheduling algorithms that only concentrate on optimizing the execution time. This paper investigates how to minimize execution cost of a workflow in clouds under a deadline constraint and proposes a metaheuristic algorithm L-ACO as well as a simple heuristic ProLiS. ProLiS distributes the deadline to each task, proportionally to a novel definition of probabilistic upward rank, and follows a two-step list scheduling methodology: rank tasks and sequentially allocates each task a service which meets the sub-deadline and minimizes the cost. L-ACO employs ant colony optimization to carry out deadline-constrained cost optimization: the ant constructs an ordered task list according to the pheromone trail and probabilistic upward rank, and uses the same deadline distribution and service selection methods as ProLiS to build solutions. Moreover, the deadline is relaxed to guide the search of L-ACO towards constrained optimization. Experimental results show that compared with traditional algorithms, the performance of ProLiS is very competitive and L-ACO performs the best in terms of execution costs and success ratios of meeting deadlines.


Author(s) Name:  Quanwang Wu; Fuyuki Ishikawa; Qingsheng Zhu; Yunni Xia; Junhao Wen

Journal name:  IEEE Transactions on Parallel and Distributed Systems

Conferrence name:  

Publisher name:  IEEE

DOI:  10.1109/TPDS.2017.2735400

Volume Information:  Volume: 28, Issue: 12, Dec. 1 2017