Load balancing for distributed branch & bound algorithms

The authors present a new load balancing strategy and its application to distributed branch & bound algorithms and demonstrate its efficiency by solving some NP-complete problems on a network of up to 256 transputers. The parallelization of their branch & bound algorithm is fully distributed. Every processor performs the same algorithm but each on a different part of the solution tree. In this case it is necessary to distribute subproblems among the processors to achieve a well balanced workload. Their load balancing method overcomes the problem of search overhead and idle times by an appropriate load model and avoids trashing effects by a feedback control method. Using this strategy they were able to achieve a speedup of up to 237.32 on a 256 processor network for very short parallel computation times, compared to an efficient sequential algorithm.<<ETX>>

[1]  Vipin Kumar,et al.  Parallel Depth First Search on the Ring Architecture , 1988 .

[2]  Michael J. Quinn,et al.  Analysis and Implementation of Branch-and Bound Algorithms on a Hypercube Multicomputer , 1990, IEEE Trans. Computers.

[3]  Oliver Vornberger,et al.  Load Balancing in a Network of Transputers , 1987, WDAG.

[4]  Reinhard Lüling,et al.  Two Strategies for Solving the Vertex Cover Problem on a Transputer Network , 1989, WDAG.

[5]  Oliver Vornberger,et al.  Parallel Processing of Combinatorial Search , 1987, Parallel Algorithms and Architectures.

[6]  Reinhard Lüling,et al.  Load balancing in large networks: a comparative study , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[7]  Robert M. Keller,et al.  The Gradient Model Load Balancing Method , 1987, IEEE Transactions on Software Engineering.

[8]  Richard M. Karp,et al.  A randomized parallel branch-and-bound procedure , 1988, STOC '88.

[9]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[10]  F. Harary,et al.  The theory of graphs and its applications , 1963 .

[11]  Gurindar S. Sohi,et al.  The Use of Feedback in Multiprocessors and Its Application to Tree Saturation Control , 1990, IEEE Trans. Parallel Distributed Syst..

[12]  J. M. Troya,et al.  A study of parallel branch-and-bound algorithms with best-bound-first search , 1989, Parallel Comput..

[13]  Jan Karel Lenstra,et al.  Parallel computing in combinatorial optimization , 1988 .

[14]  John A. Stankovic,et al.  An Adaptive Bidding Algorithm For Processes, Clusters and Distributed Groups , 1984, ICDCS.

[15]  Robert E. Tarjan,et al.  Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[16]  Oliver Vornberger,et al.  Distributed game tree search , 1990 .

[17]  Oliver Vornberger,et al.  Implementing Branch-and-Bound in a Ring of Processors , 1986, CONPAR.

[18]  Burkhard Monien,et al.  Embedding one interconnection network in another , 1990 .