On Parallel Computation for the Knapsack Problem
Journal of the ACM (JACM)
Random Trees and the Analysis of Branch and Bound Procedures
Journal of the ACM (JACM)
Parallel Search of Strongly Ordered Game Trees
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
MANIP-a parallel computer system for implementing branch and bound algorithms
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
A Partitioning Approach to the Design of Selection Networks
IEEE Transactions on Computers
IEEE Transactions on Computers
Distributed Enumeration on Between Computers
IEEE Transactions on Computers
A Design of a Fast Cellular Associative Memory for Ordered Retrieval
IEEE Transactions on Computers
A Survey of Interconnection Networks
Computer
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Coping with anomalies in parallel branch-and-bound algorithms
IEEE Transactions on Computers - The MIT Press scientific computation series
A Partitioning Approach to the Design of Selection Networks
IEEE Transactions on Computers
Parallel iterative A* search: an admissible distributed heuristic search algorithm
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Efficient parallel branch-and-bound algorithm for constructing minimum ultrametric trees
Journal of Parallel and Distributed Computing
Paper: Automatic test pattern generation on parallel processors
Parallel Computing
Parallel search for Ramsey grid colorings
Proceedings of the 50th Annual Southeast Regional Conference
Branch-and-bound and parallel computation: A historical note
Operations Research Letters
| Hi-index | 14.98 |
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.