Abstract
We describe an approach to the parallelization of game tree search on SIMD machines. It turns out that the single-instruction restriction of SIMD-machines is not a big obstacle for achieving efficiency. We achieve speedups up to 5850 on a 16K processor MasPar MP-1 if the search trees are sufficiently large and if there are no strong move ordering heuristics. To our best knowledge, the largest speedups previously reported (usually on MIMD machines) are more than an order of magnitude smaller.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. In Foundations of Computer Science, 1994.
V. Cung and L. Gotte. A first step towards the massively parallel game-tree search. In International Workshop on Parallel Processing for Artificial Intelligence, pages 88–93, Chambery, 1993. Elsevier.
O. I. El-Dessouki and W. H. Huen. Distributed enumeration on between computers. IEEE Transactions on Computers, C-29(9):818–825, September 1980.
R. Feldmann. Game Tree Search on Massively Parallel Systems. PhD thesis, Universität Paderborn, August 1993.
R. Feldmann, P. Mysliwietz, and B. Monien. Studying overheads in massively parallel min/max-tree evaluation. In ACM Symposium on Parallel Architectures and Algorithms, pages 94–103, 1994.
R. Finkel and J. Fishburn. Parallelism in alpha-beta search. Artificial Intelligence, 19:89–106, 1982.
W. D. Hillis. The Connection Machine. Series in Artificial Inteligence. MIT Press, Cambridge, MA, 1985.
H. Hopp. Parallele Spielbaumsuche auf SIMD-Rechnern. Diplomarbeit, Universität Karlsruhe, Feb. 1995.
C. F. Joerg and B. C. Kuszmaul. Massively parallel chess. In Third DIMACS parallel implementation challenge workshop, pages 299–308. Rutgers University, 1994.
G. Karypis and V. Kumar. Unstructured tree search on SIMD parallel computers. IEEE Transactions on Parallel and Distributed Systems, 5(10):1057–1072, 1994.
D. Knuth and W. Moore. An analysis of alpha-beta pruning. Artificial Intelligence, 6(4):293–326, 1975.
V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing. Design and Analysis of Algorithms. Benjamin/Cummings, 1994.
T. A. Marsland and M. Campbell. Parallel search of strongly ordered game trees. ACM Computing Surveys, 14(4):533–551, Dec. 1982.
MasPar Corporation. MasPar System Overview, July 1992.
MasPar Corporation. MPL Reference Manual, May 1993.
C. Powley, C. Ferguson, and R. E. Korf. Depth-fist heuristic search on a SIMD machine. Artificial Intelligence, 60:199–242, 1993.
A. Reinefeld. Spielbaum-Suchverfahren. Informatik-Fachberichte, Band 200. Springer-Verlag, 1989.
P. Sanders. A detailed analysis of random polling dynamic load balancing. In International Symposium on Parallel Architectures Algorithms and Networks, pages 382–389, Kanazawa, Japan, 1994. IEEE.
P. Sanders. Efficient emulation of MIMD behavior on SIMD machines. Technical Report IB 29/95, Universität Karlsruhe, Fakultät für Informatik, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hopp, H., Sanders, P. (1995). Parallel game tree search on SIMD machines. In: Ferreira, A., Rolim, J. (eds) Parallel Algorithms for Irregularly Structured Problems. IRREGULAR 1995. Lecture Notes in Computer Science, vol 980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60321-2_28
Download citation
DOI: https://doi.org/10.1007/3-540-60321-2_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60321-4
Online ISBN: 978-3-540-44915-7
eBook Packages: Springer Book Archive