A heuristic algorithm for solving the problem of load balancing

Author

Jiayin Wei ; Daoyun Xu ; Yongbin Qin ; Jincheng Zhou

Author_Institution

Dept. of Comput. Sci. & Technol., Guizhou Univ., Guiyang, China

fYear

2015

fDate

27-29 March 2015

Firstpage

89

Lastpage

96

Abstract

Load balancing is one of the most important problems in the field of algorithm design. This problem is NP-hard while there exists a polynomial time approximation scheme (PTAS). In order to design an effective approximation algorithm for this problem, we introduce the concept of β-Flatness and a corresponding planarization algorithm (β_PALNM) in this work, and then propose a heuristic algorithm called LBABP to solve the load balancing problem. A better approximate solution can be obtained by LBABP in O(n(logn)²) time. The experimental results show that LBABP is not only better than the Greedy and LPT, but also has good performance in the large size problem.

Keywords

Big Data; cloud computing; computational complexity; resource allocation; β-flatness; β_PALNM; LBABP; NP-hard problem; PTAS; algorithm design; heuristic algorithm; load balancing; planarization algorithm; polynomial time approximation scheme; Silicon;

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Computational Intelligence (ICACI), 2015 Seventh International Conference on

Conference_Location

Wuyi

Print_ISBN

978-1-4799-7257-9

Type

conf

DOI

10.1109/ICACI.2015.7184755

Filename

7184755