Online and offline based load balance algorithm in cloud computing

摘要

Cloud Computing (CC) makes it possible for a common user to get an access to large pools of data and computational resources through a variety of interfaces. Among the so many important problems in CC, load balancing technique has been paid more and more attention for its important role. Good load balance algorithms can make whole system run more efficient. A new load balancing method combined with the advantage of online and offline load balancing algorithms are proposed in this paper. Two-choice algorithm and its improvement are used in the online step. Bacteria Foraging Optimization (BFO) and its improvement motivated by Lamarck Evolutionary Theory are introduced in our offline step. Online load balancing uses imperfect information, aiming at finishing tasks as fast as possible; while the offline makes full use of all information to make a supplement. Experiments on the heterogeneous tasks and serving points for computation intensive loads have been used here and the good performance shows the efficiency of our proposed method.