On Optimal Scheduling Algorithms for Well-Structured Workflows in the Cloud with Budget and Deadline Constraints
文献类型：期刊论文
| 作者 | Yang Wang; Wei Shi; Kenneth Kent |
| 刊名 | parallel processing letters
 |
| 出版日期 | 2016 |
| 英文摘要 | In this paper, we consider optimal scheduling algorithms for scientific workows with two typical structures, fork&join and tree, on a set of provisioned (virtual) machines under budget and deadline constraints in cloud computing. First, given a total budget B, by leveraging a bi-step dynamic programming technique, we propose optimal algorithms in pseudo-polynomial time for both workows with minimum scheduling length as a goal. Our algorithms are efficient if the total budget B is polynomially bounded by the number of jobs in respective workows, which is usually the common case in practice. Second, we consider the dual of this optimization problem to minimize the cost when the deadline of the computation D is fixed. We change this problem into the standard multiple-choice knapsack problem via a parallel transformation. Read More: http://www.worldscientific.com/doi/abs/10.1142/S0129626416500092 |
| 收录类别 | EI |
| 原文出处 | http://www.worldscientific.com/doi/abs/10.1142/S0129626416500092 |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/10234]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | parallel processing letters |
| 推荐引用方式 GB/T 7714 | Yang Wang,Wei Shi,Kenneth Kent. On Optimal Scheduling Algorithms for Well-Structured Workflows in the Cloud with Budget and Deadline Constraints[J]. parallel processing letters,2016. |
| APA | Yang Wang,Wei Shi,&Kenneth Kent.(2016).On Optimal Scheduling Algorithms for Well-Structured Workflows in the Cloud with Budget and Deadline Constraints.parallel processing letters. |
| MLA | Yang Wang,et al."On Optimal Scheduling Algorithms for Well-Structured Workflows in the Cloud with Budget and Deadline Constraints".parallel processing letters (2016). |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。