Search Swinburne Research Bank
This object has not yet been indexed by the background indexing service.
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/196663
|Download PDF (Published version) (Adobe Acrobat PDF, -1 bytes)|
- An algorithm in SwinDeW-C for scheduling transaction-intensive cost-constrained cloud workflows
- Yang, Yun; Liu, Ke; Chen, Jinjun; Liu, Xiao; Yuan, Dong; Jin, Hai
- 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.
- Publication type
- Conference paper
- Research centre
- Swinburne University of Technology. Faculty of Information and Communication Technologies
- Proceedings of the 4th IEEE International Conference on eScience (eScience 2008), Indianapolis, Indiana, United States, 07-12 December 2008, pp. 374-375
- Publication year
- Publisher URL
- Copyright © 2008 IEEE. Published version of this paper reproduced here in accordance with the copyright policy of the publisher. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.