4.3 Article

A Compromised-Time-Cost Scheduling Algorithm in SwinDeW-C for Instance-Intensive Cost-Constrained Workflows on a Cloud Computing Platform

Publisher

SAGE PUBLICATIONS LTD
DOI: 10.1177/1094342010369114

Keywords

Cloud Workflows; Workflow Scheduling Algorithms; Instance-Intensive Workflows; Cost-Constrained Workflows; Cloud Computing

Funding

  1. Australian Research Council [LP0990393]
  2. National Science Foundation of China [90412010]
  3. Ministry of Education of China
  4. Australian Research Council [LP0990393] Funding Source: Australian Research Council

Ask authors/readers for more resources

The concept of cloud computing continues to spread widely, as it has been accepted recently. Cloud computing has many unique advantages which can be utilized to facilitate workflow execution. Instance-intensive cost-constrained cloud workflows are workflows with a large number of workflow instances (i. e. instance intensive) bounded by a certain budget for execution (i. e. cost constrained) on a cloud computing platform (i. e. cloud workflows). However, there are, so far, no dedicated scheduling algorithms for instance-intensive cost-constrained cloud workflows. This paper presents a novel compromised-time-cost scheduling algorithm which considers the characteristics of cloud computing to accommodate instance-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 cut down the mean execution cost by over 15% whilst meeting the user-designated deadline or shorten the mean execution time by over 20% within the user-designated execution cost.

Authors

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

Reviews

Primary Rating

4.3
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available