
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M.J. Quinn, "Analysis and Implementation of BranchandBound Algorithms on a Hypercube Multicomputer," IEEE Transactions on Computers, vol. 39, no. 3, pp. 384387, March, 1990.  
BibTex  x  
@article{ 10.1109/12.48868, author = {M.J. Quinn}, title = {Analysis and Implementation of BranchandBound Algorithms on a Hypercube Multicomputer}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {3}, issn = {00189340}, year = {1990}, pages = {384387}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.48868}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Analysis and Implementation of BranchandBound Algorithms on a Hypercube Multicomputer IS  3 SN  00189340 SP384 EP387 EPD  384387 A1  M.J. Quinn, PY  1990 KW  branchandbound algorithms; hypercube multicomputer; computationallyintensive nature; parallelization; productive work; interprocessor communications; critical path; statespace tree; traveling salesperson problem; multiprocessing systems; parallel algorithms; performance evaluation. VL  39 JA  IEEE Transactions on Computers ER   
The feasibility of implementing bestfirst (bestbound) branchandbound algorithms on hypercube multicomputers is discussed. The computationallyintensive 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 statespace 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 branchandbound 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 microprocessorbased hypercube supercomputer,"IEEE Micro, vol. 6, pp. 617, Oct. 1986.
[2] T.H. Lai and S. Sahni, "Anomalies in parallel branchandbound algorithms," inProc. 1983 Int. Conf. Parallel Processing, 1983, pp. 183190.
[3] T.H. Lai and S. Sahni, "Anomalies in Parallel BranchandBound Algorithms,"Comm. ACM, June 1984, pp. 594602.
[4] T.H. Lai and A. Sprague, "Performance of parallel branchandbound algorithms,"IEEE Trans. Comput., vol. C34, pp. 962964, 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. 972989, 1963.
[6] J. Mohan, "Experience with two parallel programs solving the traveling salesman problem," inProc. 1983 Int. Conf. Parallel Processing, IEEE, 1983, pp. 191193.
[7] M. Quinn,Designing Efficient Algorithms for Parallel Computers. New York: McGrawHill, 1987.
[8] M. J. Quinn and N. Deo, "An upper bound for the speedup of parallel branchandbound algorithms," inProc. Third Conf. Foundations Software Technol. Theoret. Comput. Sci., Bangalore, India, 1983, pp. 488504.
[9] M. J. Quinn and N. Deo, "An upper bound for the speedup of parallel bestfirst branchandbound algorithms,"BIT, vol. 26, pp. 3543, 1986.
[10] E. M. Reingold, J. Nievergelt, and N. Deo,Combinatorial Algorithms: Theory and Practice. Englewood Cliffs, NJ: PrenticeHall, 1977.
[11] B. W. Wah, G.J. Li, and C. F. Yu, "The status of MANIPA multicomputer architecture for solving combinatorial extremumsearch problems," inProc. 11th Annu. Int. Symp. Comput. Architecture, 1984, pp. 5663.
[12] B. W. Wah, G.J. Li, and C. F. Yu, "Multiprocessing of combinatorial search problems,"IEEE Comput. Mag., vol. 18, pp. 93108, 1985.