Anzeige
Erschienen in:
1995 | ReviewPaper | Buchkapitel
Parallel game tree search on SIMD machines
verfasst von : Holger Hopp, Peter Sanders
Erschienen in: Parallel Algorithms for Irregularly Structured Problems
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.