This Article 
 Bibliographic References 
 Add to: 
Analysis and Implementation of Branch-and-Bound Algorithms on a Hypercube Multicomputer
March 1990 (vol. 39 no. 3)
pp. 384-387

The feasibility of implementing best-first (best-bound) branch-and-bound algorithms on hypercube multicomputers is discussed. The computationally-intensive nature of these algorithms might lead a causal observer to believe that their parallelization is trivial. However, as the number of processors grows, two goals must be satisfied to some degree in order to maintain a reasonable level of efficiency. First, processors must be kept busy doing productive work (i.e. exploring worthwhile subproblems). Second, the number of interprocessor communications must be minimized along the critical path in the state-space tree from the original problem to the subproblem yielding a solution. It is difficult to improve performance in one of these areas without degrading performance in the other. Analytical models for the execution time of loosely synchronous and asynchronous parallel branch-and-bound algorithms are presented, and the models are validated with data from the execution of five algorithms that solve the traveling salesperson problem.

[1] J. P. Hayeset al., "A microprocessor-based hypercube supercomputer,"IEEE Micro, vol. 6, pp. 6-17, Oct. 1986.
[2] T.-H. Lai and S. Sahni, "Anomalies in parallel branch-and-bound algorithms," inProc. 1983 Int. Conf. Parallel Processing, 1983, pp. 183-190.
[3] T.H. Lai and S. Sahni, "Anomalies in Parallel Branch-and-Bound Algorithms,"Comm. ACM, June 1984, pp. 594-602.
[4] T.-H. Lai and A. Sprague, "Performance of parallel branch-and-bound algorithms,"IEEE Trans. Comput., vol. C-34, pp. 962-964, 1985.
[5] J. D. C. Little, K. G. Murty, D. W. Sweeney, and C. Karel, "An algorithm for the traveling salesman problem,"Oper. Res., vol. 11, pp. 972-989, 1963.
[6] J. Mohan, "Experience with two parallel programs solving the traveling salesman problem," inProc. 1983 Int. Conf. Parallel Processing, IEEE, 1983, pp. 191-193.
[7] M. Quinn,Designing Efficient Algorithms for Parallel Computers. New York: McGraw-Hill, 1987.
[8] M. J. Quinn and N. Deo, "An upper bound for the speedup of parallel branch-and-bound algorithms," inProc. Third Conf. Foundations Software Technol. Theoret. Comput. Sci., Bangalore, India, 1983, pp. 488-504.
[9] M. J. Quinn and N. Deo, "An upper bound for the speedup of parallel best-first branchand-bound algorithms,"BIT, vol. 26, pp. 35-43, 1986.
[10] E. M. Reingold, J. Nievergelt, and N. Deo,Combinatorial Algorithms: Theory and Practice. Englewood Cliffs, NJ: Prentice-Hall, 1977.
[11] B. W. Wah, G.-J. Li, and C. F. Yu, "The status of MANIP--A multicomputer architecture for solving combinatorial extremum-search problems," inProc. 11th Annu. Int. Symp. Comput. Architecture, 1984, pp. 56-63.
[12] B. W. Wah, G.-J. Li, and C. F. Yu, "Multiprocessing of combinatorial search problems,"IEEE Comput. Mag., vol. 18, pp. 93-108, 1985.

Index Terms:
branch-and-bound algorithms; hypercube multicomputer; computationally-intensive nature; parallelization; productive work; interprocessor communications; critical path; state-space tree; traveling salesperson problem; multiprocessing systems; parallel algorithms; performance evaluation.
M.J. Quinn, "Analysis and Implementation of Branch-and-Bound Algorithms on a Hypercube Multicomputer," IEEE Transactions on Computers, vol. 39, no. 3, pp. 384-387, March 1990, doi:10.1109/12.48868
Usage of this product signifies your acceptance of the Terms of Use.