Bandwidth‐aware divisible task scheduling for cloud computing. (23rd November 2012)

• Record Type: Journal Article
• Authors: Lin, Weiwei; Liang, Chen; Wang, James Z.; Buyya, Rajkumar
• Is Part Of: Software, practice & experience. Volume 44:Number 2(2014)
• Page Start: 163
• Page End: 174
• Publication Date: 2012-11-23
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2163
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main"> <title>SUMMARY</title> <p>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 &amp; Sons, Ltd.</p> </abstract>