文章基本信息

标题：The Branch & Bound Algorithm Improvement in Divisible Load Scheduling with Result Collection on Heterogeneous Systems by New Heuristic Function
本地全文：下载
作者：Farzad Norouzi Fard ; Sasan Mohammadi ; Peyman Parvizi 等
期刊名称：Journal of Automation, Mobile Robotics & Intelligent Systems (JAMRIS)
印刷版ISSN：1897-8649
电子版ISSN：2080-2145
出版年度：2012
卷号：6
期号：3
页码：47
出版社：Industrial Research Inst. for Automation and Measurements, Warsaw
摘要：In this paper we propose a new heuristic function for branch & bound algorithm. By this function we can in- crease the efficiency of branch & bound algorithm. Di- visible loads represent computations which can be arbi- trarily divided into parts and performed independently parallel. The scheduling problem consists in distribut- ing the load in a heterogeneous system taking into ac- count communication and computation times, so that the whole processing time is as short as possible. Since our scheduling problem is computationally hard, we propose a branch & bound algorithm. By simulating and compar- ing results it is observed which this result produces bet- ter answers than other methods, it means that branch & bound algorithm have less total average of relative error percentage in the variety Heuristic functions.
关键词：divisible load scheduling; heterogeneous ; systems; branch & bound algorithm