Bandwidth-aware divisible task scheduling for cloud computing
Article first published online: 23 NOV 2012
Copyright © 2012 John Wiley & Sons, Ltd.
Software: Practice and Experience
Volume 44, Issue 2, pages 163–174, February 2014
How to Cite
Lin, W., Liang, C., Wang, J. Z. and Buyya, R. (2014), Bandwidth-aware divisible task scheduling for cloud computing. Softw: Pract. Exper., 44: 163–174. doi: 10.1002/spe.2163
- Issue published online: 2 JAN 2014
- Article first published online: 23 NOV 2012
- Manuscript Accepted: 27 SEP 2012
- Manuscript Revised: 10 JUL 2012
- Manuscript Received: 4 NOV 2011
- cloud computing;
- task-scheduling algorithm;
- nonlinear programming model
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 © 2012 John Wiley & Sons, Ltd.