z-logo
Premium
Budget‐constraint stochastic task scheduling on heterogeneous cloud systems
Author(s) -
Tang Xiaoyong,
Li Xiaochun,
Fu Zhuojun
Publication year - 2017
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.4210
Subject(s) - computer science , cloud computing , scheduling (production processes) , distributed computing , schedule , job shop scheduling , task (project management) , mathematical optimization , operating system , mathematics , management , economics
Summary In the past few years, more and more business‐to‐consumer and enterprise applications run in the heterogeneous clouds. Such cloud bag‐of‐tasks applications are usually budget constrained, and their scheduling is an essential problem for cloud provider. The problem is even more complex and challenging when the accurate knowledge about task execution time is unknown in advance. Focusing on these challenges, we first build a cloud resource management architecture and stochastic task model, which divides cloud task into two execution parts. Then, we deduce bag‐of‐tasks applications' schedule length (Makespan) and total cost according to heterogeneous clouds' online feedback information of task first part execution. Thirdly, we formulate this stochastic scheduling problem as a linear programming problem. Lastly, we propose a time and cost multiobjective stochastic task scheduling genetic algorithm, in which can find Pareto optimal schedules for stochastic cloud task that meet its budget constraint. The extensive simulation experiments were carried out on a heterogeneous cloud platform with 400 virtual machines, and tasks were derived from Parallel Workloads Archive and the analysis data of real‐world cloud systems. The experimental results show that our proposed stochastic task scheduling genetic algorithm can get shorter schedule length and lower cost with task budget constraints.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here