Article

Free access

Unstructured tree search on SIMD parallel computers: a summary of results

Authors:

G. Karypis,

V. KumarAuthors Info & Claims

Supercomputing '92: Proceedings of the 1992 ACM/IEEE conference on Supercomputing

Pages 453 - 462

Published: 01 December 1992 Publication History

PDF eReader

References

[1]

S. Arvindam, Vipin Kumar, and V. Nageshwara Rao. Efficient Parallel Algorithms for Search Problems: Applications in VLSI CAD. In Proc. of the Frontiers 90 Conf. on Massively Parallel Computation, October 1990.

Crossref

Google Scholar

[2]

S. Arvindam, Vipin Kumar, V. Nageshwara Rao, and Vineet $ingh. Automatic test Pattern Generation on Multiprocessors. Parallel Computing, 17, number 12:1323-1342, December 1991.

Google Scholar

[3]

M. Evett, James Hendler, Ambujashka Mahanti, and Dana Nau. PRA*: A Memory-Limited Heuristic Search Procedure for the Connection Machine. In Proc. of the third symposium on the Frontiers of Massively Parallel Computation, pages 145-149, 1990.

Crossref

Google Scholar

[4]

Raphael A. Finkel and Udi Manber. DIB- A Distributed implementation of Backtracking. A CM Trans. of Progr. Lang. and Systems, 9 No. 2:235-256, April 1987.

Digital Library

Google Scholar

[5]

Roger Frye and Jacek Myczkowski. Exhaustive Search of Unstructured Trees on the Connection Machine. Thinking Machines Corporation Tech. Rep., 1990.

Google Scholar

[6]

M. Furuichi, K. Taki, and N. Ichiyoshi. A Multi-Level Load Balancing Scheme for OR-Parallel Exhaustive Search Programs on the Multi-PSI. in Proc. of the 2nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1990. pp.50-59.

Digital Library

Google Scholar

[7]

Ananth Grama, Vipin Kumar, and V. Nageshwara Rao. Experimental Evaluation of Load Balancing Techniques for the Hypercube. In Proc. of the Parallel Computing 91 Conf., 1991.

Google Scholar

[8]

Anshul Gupta and Vipin Kumar. On the scalability of FFT on Parallel Computers. In Proc. of the Frontiers 90 Conf. on Massively Parallel Computation, October 1990. An extended version of the paper will appear in IEEE Trans. on Parallel and Distributed Systems, 1993.

Digital Library

Google Scholar

[9]

John L. Gustafson, Gary R. Montry, and Robert "E. Benner. Development of Parallel Methods for a 1024- Processor Hypercube. SIAM Journal on Scientific and Statistical Computing, 9 No. 4:609-638, 1988.

Digital Library

Google Scholar

[10]

W. Daniel Hillis. The Connection Machine. MIT Press, 1991.

Digital Library

Google Scholar

[11]

Ellis Horowitz and Sartaj Sahni. Fundamentals of Computer Algorithms. Computer Science Press, Rockville, Maryland, 1978.

Digital Library

Google Scholar

[12]

Laveen Kanal and Vipin Kumar. Search in Artificial Intelligence. Springer-Verlag, New York, 1988.

Digital Library

Google Scholar

[13]

George Karypis and Vipin Kumar. Unstructured Tree Search on SIMD Parallel Computers. Tech. Rep. TR- 92-21, Computer Science Department, University of MN, 1992.

Google Scholar

[14]

Richard E. Korf. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search. Artificial Intelligence, 27:97-109, 1985.

Digital Library

Google Scholar

[15]

Vipin Kumar. DEPTH-FIRST SEARCH. In Stuart C. Shapiro, editor, Encyclopaedia of Artificial Intelligence: Vol 2, pages 1004-1005. John Wiley and Sons, Inc., New York, 1987. Revised version appears in the second edition of the encyclopedia to be pubfished in 1992.

Google Scholar

[16]

Vipin Kumar, Ananth Grama, and V. Nageshwara Rao. Scalable Load Balancing Techniques for Parallel Computers. Tech. Rep., TR-91-55, Computer Science Department, University of MN, 1991.

Google Scholar

[17]

Vipin Kumar and Anshul Gupta. Analyzing Scalability of Parallel Algorithms and Architectures. Tech. Rep., TR-91-18, Computer Science Department, University of MN, June 1991. A short version of the paper appears in the Proc. of the 1991 Int. Conf. on Supercomputing, Germany, and as an invited paper in the Proc. of 29th Annum Allerton Conf. on Communuication, Control and Computing, Urbana, IL, October 1991.

Digital Library

Google Scholar

[18]

Vipin Kumar, Dana Nau, and Laveen Kanal. General Branch-and-bound Formulation for AND/OR Graph and Game Tree Search. In Laveen Kanal and Vipin Kumar, editors, Search in Artificial Intelligence. Springer-Verlag, New York, 1988.

Digital Library

Google Scholar

[19]

Vipin Kumar and V. Nageshwara Rao. Parallel Depth-First Search, Part II: Analysis. Int. Journal of Parallel Programming, 16, 1987.

Digital Library

Google Scholar

[20]

Vipin Kumar and Vineet Singh. Scalability of Parallel Algorithms for the All-Pairs Shortest Path Problem: A Summary of Results. Extended version appears in Journal of Parallel and Distributed Processing (special issue on massively parallel computation), Volume 13, 1991.

Digital Library

Google Scholar

[21]

Karp R. M. Challenges in Combinatorial Computing. To appear January 1991.

Google Scholar

[22]

A. Mahanti and C. Daniels. SIMD Parallel Heuristic Search. To appear in Artificial Intelligence, 1992.

Digital Library

Google Scholar

[23]

V. Nageshwara Rao and Vipin Kumar. Parallel Depth-First Search, Part I: Implementation. Int. Journal of Parallel Programming, 16, 1987.

Digital Library

Google Scholar

[24]

Nils J. Nilsson. Principles of Artificial Intelligence. Tioga Press, 1980.

Digital Library

Google Scholar

[25]

Christos H. Papadimitriou and Kenneth Steiglitz. Combinatorial Optimization, Algorithms and Complexity. Prentice Hall, 1982.

Digital Library

Google Scholar

[26]

Judea Pearl. Heuristics - Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading, MA, 1984.

Digital Library

Google Scholar

[27]

C. Powley, R. Korf, and C. Ferguson. IDA ~ on the Connection Machine. To appear in Artificial Intelligence, 1992.

Google Scholar

[28]

Curt Powley and Richard E. Korf. SIMD and MIMD Parallel Search. In Proc. of the AAAI Spring Syrup., pages 49-53, 1989.

Google Scholar

[29]

Abhiram Ranade. Optimal Speedup for Backtrack Search on a Butterfly Network. In Proc. of the Third A CM Syrup. on Parallel Algorithms and Architectures, 1991.

Digital Library

Google Scholar

[30]

V. Nageshwara Rao and Vipin Kumar. On the Efficicency of Parallel Backtracking. IEEE Trans. on Parallel and Distributed Systems, (to appear), 1992. available as a tech. rep. TR 90-55, Computer Science Department, University of MN.

Digital Library

Google Scholar

[31]

Jasec Myczkowski Roger Frye. Load Balancing Algorithms on the Connection Machine and their Use in Monte-Carlo Methods. In Proc. of the Unstructured Scientific Computation on Multiprocessors Conj., 1992.

Digital Library

Google Scholar

[32]

Wei Shu and L. V. Kale. A Dynamic Scheduling Strategy for the Chafe-Kernel System. In Proc. of Supercomputing 89, pages 389-398, 1989.

Digital Library

Google Scholar

[33]

Benjamin W. Wah and Y. W. Eva Ma. MANIP- A Multicomputer Architecture for Solving Combinatorial Extremum-Search Problems. IEEE Trans. on Computers, c-33, May 1984.

Google Scholar

Cited By

View all

Eckstein J(2019)Distributed versus Centralized Storage and Control forParallel Branch and BoundComputational Optimization and Applications10.1023/A:10086990106467:2(199-220)Online publication date: 28-May-2019
https://dl.acm.org/doi/10.1023/A%3A1008699010646
Eckstein JJohnson G(1994)Control strategies for parallel mixed integer branch and boundProceedings of the 1994 ACM/IEEE conference on Supercomputing10.5555/602770.602785(41-48)Online publication date: 14-Nov-1994
https://dl.acm.org/doi/10.5555/602770.602785

Index Terms

Unstructured tree search on SIMD parallel computers: a summary of results

Recommendations

Unstructured Tree Search on SIMD Parallel Computers

We present new methods for load balancing of unstructured tree computations onlarge-scale SIMD machines, and analyze the scalability of these and other existingschemes. An efficient formulation of tree search on an SIMD machine consists of twomajor ...
Parallel tree search on a SIMD machine
SPDP '91: Proceedings of the 1991 Third IEEE Symposium on Parallel and Distributed Processing

Presents an implementation of a depth-first heuristic tree search on the single-instruction, multiple-data (SIMD) Connection Machine. The algorithm is based on Iterative-Deepening-A*. Until recently, only highly regular, data-parallel computations have ...
Parallel Monte-Carlo Tree Search
CG '08: Proceedings of the 6th international conference on Computers and Games

Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the strength of any Go program. In this article, we discuss three parallelization ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Supercomputing '92: Proceedings of the 1992 ACM/IEEE conference on Supercomputing

December 1992

872 pages

ISBN:0818626305

Editor:
Robert Werner

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 01 December 1992

Check for updates

Qualifiers

Article

Conference

SC '92

Sponsor:

SIGARCH
IEEE-CS

SC '92: International Conference for High Performance Computing, Networking, Storage and Analysis

November 16 - 20, 1992

Minnesota, Minneapolis, USA

Acceptance Rates

Supercomputing '92 Paper Acceptance Rate 75 of 220 submissions, 34%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
284
Total Downloads

Downloads (Last 12 months)28
Downloads (Last 6 weeks)9

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Eckstein J(2019)Distributed versus Centralized Storage and Control forParallel Branch and BoundComputational Optimization and Applications10.1023/A:10086990106467:2(199-220)Online publication date: 28-May-2019
https://dl.acm.org/doi/10.1023/A%3A1008699010646
Eckstein JJohnson G(1994)Control strategies for parallel mixed integer branch and boundProceedings of the 1994 ACM/IEEE conference on Supercomputing10.5555/602770.602785(41-48)Online publication date: 14-Nov-1994
https://dl.acm.org/doi/10.5555/602770.602785

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Unstructured Tree Search on SIMD Parallel Computers

Parallel tree search on a SIMD machine

Parallel Monte-Carlo Tree Search