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

Authors:
Yun Yang;Ke Liu;Jinjun Chen;Xiao Liu;Dong Yuan;Hai Jin
Affiliations:
-;-;-;-;-;-
Venue:
ESCIENCE '08 Proceedings of the 2008 Fourth IEEE International Conference on eScience
Year:
2008

Citing 0
Cited 5

A data placement strategy in scientific cloud workflows

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

International Journal of High Performance Computing Applications
A novel statistical time-series pattern based interval forecasting strategy for activity durations in workflow systems

Journal of Systems and Software
CAD: an efficient data management and migration scheme across clouds for data-intensive scientific applications

Globe'11 Proceedings of the 4th international conference on Data management in grid and peer-to-peer systems
Scheduling parameter sweep workflow in the Grid based on resource competition

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of cloud computing has been wide spreading very recently. Cloud computing has many unique advantages which can be utilised 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.