This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
B.W. Wah, School of Electrical Engineering, Purdue University
In this paper, we propose and analyze the design of MANIP, a parallel machine for processing nondeterministic polynomial (NP)-hard problems. The most general technique that can be used to solve a wide variety of NP-hard problems on a uniprocessor system, optimally or suboptimally, is the branch-and-bound algorithm. We have adapted and extended branch-and-bound algorithms for parallel processing. The parallel branch-and-bound algorithmn requires a combination of sorting and merging that will be too inefficient to perform in a common memory. We have proposed a system with distributed intelligence so that sorting can be carried out efticiently. A unidirectional ring network is shown to be the most cost-effective interprocessor communication network. The performance on the proposed system is evaluated using the vertex-covering problem.
Index Terms:
virtual memory, Approximate branch-and-bound, NP-hard problems, parallel branch-and-bound, ring network, selection, vertex-covering problem
Citation:
B.W. Wah, Y.W.E. Ma, "MANIP?A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems," IEEE Transactions on Computers, vol. 33, no. 5, pp. 377-390, May 1984, doi:10.1109/TC.1984.1676453
Usage of this product signifies your acceptance of the Terms of Use.