Skip to:

e-Science 2008 4th IEEE International Conference on e-Science

Exhibits, Demos & Posters

An Algorithm in SwinDeW-C for Scheduling Transaction-Intensive Cost-Constrained Cloud Workflows

Authors

  • Yun Yang, Swinburne University of Technology, Melbourne, Australia
  • Ke Liu, Swinburne University of Technology, Melbourne Australia; Huazhong University of Science and Technology, Wuhan, Hubei, China
  • Jinjun Chen, Swinburne University of Technology, Melbourne, Australia
  • Xiao Liu, Swinburne University of Technology, Melbourne, Australia
  • Dong Yuan, Swinburne University of Technology, Melbourne, Australia
  • Hai Jin, Huazhong University of Science and Technology, Wuhan, Hubei, China

Abstract

The concept of cloud computing has become widespread very recently. Cloud computing has many unique advantages which can be utilized to facilitate (cloud) workflow execution. Transaction-intensive cost-constrained cloud workflows are workflows with a large number of workflow instances (i.e., transaction intensive) bounded by a certain budget for execution (i.e., cost constrained) in a cloud computing environment (i.e., cloud workflows). However, there are not any specific scheduling algorithms so far for transaction-intensive cost-constrained cloud workflows. This paper presents a novel scheduling algorithm which considers the characteristics of cloud computing to accommodate transaction-intensive cost-constrained workflows by compromising execution time and cost with user input enabled on the fly. The simulation performed demonstrates that the algorithm can reduce the mean execution cost while meeting the user-requested deadline.

More Information

Show your support for e-Science 2008

Add one of our badges to your site:

  • Teal eScience 2008 Web badge
  • Green eScience 2008 Web badge
  • Orange eScience 2008 Web badge