Bandwidth-aware divisible task scheduling for cloud computing

被引:106
作者
Lin, Weiwei [1 ]
Liang, Chen [1 ]
Wang, James Z. [2 ]
Buyya, Rajkumar [3 ]
机构
[1] S China Univ Technol, Sch Comp Engn & Sci, Guangzhou, Guangdong, Peoples R China
[2] Clemson Univ, Sch Comp, Clemson, SC 29634 USA
[3] Univ Melbourne, Dept Comp Sci & Software Engn, Cloud Comp & Distributed Syst Lab, Parkville, Vic 3052, Australia
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
cloud computing; task-scheduling algorithm; nonlinear programming model;
D O I
10.1002/spe.2163
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Task scheduling is a fundamental issue in achieving high efficiency in cloud computing. However, it is a big challenge for efficient scheduling algorithm design and implementation (as general scheduling problem is NP-complete). Most existing task-scheduling methods of cloud computing only consider task resource requirements for CPU and memory, without considering bandwidth requirements. In order to obtain better performance, in this paper, we propose a bandwidth-aware algorithm for divisible task scheduling in cloud-computing environments. A nonlinear programming model for the divisible task-scheduling problem under the bounded multi-port model is presented. By solving this model, the optimized allocation scheme that determines proper number of tasks assigned to each virtual resource node is obtained. On the basis of the optimized allocation scheme, a heuristic algorithm for divisible load scheduling, called bandwidth-aware task-scheduling (BATS) algorithm, is proposed. The performance of algorithm is evaluated using CloudSim toolkit. Experimental result shows that, compared with the fair-based task-scheduling algorithm, the bandwidth-only task-scheduling algorithm, and the computation-only task-scheduling algorithm, the proposed algorithm (BATS) has better performance. Copyright (c) 2012 John Wiley & Sons, Ltd.
引用
收藏
页码:163 / 174
页数:12
相关论文
共 28 条
[1]  
[Anonymous], 2008, P 10 IEEE INT C HIGH
[2]  
[Anonymous], 2010, 2010 2 INT C COMN SY, DOI DOI 10.1109/COMSNETS.2010.5431965
[3]  
[Anonymous], INT J INFORM COMMUNI
[4]  
[Anonymous], P 8 INT S NUER NETW
[5]  
[Anonymous], P 22 IEEE INT S PAR
[6]  
[Anonymous], P INT C PAR DISTR PR
[7]  
[Anonymous], 15 ANN INT C PAR DIS
[8]  
[Anonymous], 1996, Scheduling divisible loads in parallel and distributed systems
[9]   CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms [J].
Calheiros, Rodrigo N. ;
Ranjan, Rajiv ;
Beloglazov, Anton ;
De Rose, Cesar A. F. ;
Buyya, Rajkumar .
SOFTWARE-PRACTICE & EXPERIENCE, 2011, 41 (01) :23-50
[10]  
Fang YQ, 2010, LECT NOTES COMPUT SC, V6318, P271, DOI 10.1007/978-3-642-16515-3_34