The status of manip - a multicomputer architecture for solving, combinatorial extremum-search problems

Authors:
Benjamin W. Wah;Guo-Jie Li;Chee-Fen Yu
Affiliations:
School of Electrical Engineering, Purdue University, West Lafayette, IN;School of Electrical Engineering, Purdue University, West Lafayette, IN;School of Electrical Engineering, Purdue University, West Lafayette, IN
Venue:
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Year:
1984

Citing 6
Cited 4

Principles of artificial intelligence

Principles of artificial intelligence
Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems

Journal of the ACM (JACM)
The Power of Dominance Relations in Branch-and-Bound Algorithms

Journal of the ACM (JACM)
Ubiquitous B-Tree

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

Coping with anomalies in parallel branch-and-bound algorithms

IEEE Transactions on Computers - The MIT Press scientific computation series
Survey on special purpose computer architectures for AI

ACM SIGART Bulletin
Analysis and Implementation of Branch-and-Bound Algorithms on a Hypercube Multicomputer

IEEE Transactions on Computers
MANIP A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we report the status of study on MANIP, a parallel computer for solving combinatorial extremum-search problems. The most general technique that can be used to solve a wide variety of these problems on a uniprocessor system, optimally or sub-optimally, is the branch-and-bound algorithm. We have adapted and extended branch-and-bound algorithms with lower-bound tests for parallel processing. Three major problems are identified in the design: interconnection networks for supporting the selection of subproblems, anomalies in parallelism and virtual-memory support. A unidirectional ring network has been shown to be the most cost-effective selection network. We provide sufficient conditions so that anomalies can be eliminated under certain conditions and show that anomalies are unavoidable otherwise. Lastly, we develop a modified branch-and-bound algorithm so that the amount of memory space required under a best-first search is significantly reduced.