[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article

Parallelism in alpha-beta search

Published: 01 September 1982 Publication History

Abstract

We present a distributed algorithm for implementing α-β search on a tree of processors. Each processor is an independent computer with its own memory and is connected by communication lines to each of its nearest neighbors. Measurements of the algorithm's performance on the Arachne distributed operating system are presented. A theoretical model is developed that predicts at least order of k12 speedup with k processors.

Cited By

View all
  • (2010)Strategies for preparing computer science students for the multicore worldProceedings of the 2010 ITiCSE working group reports10.1145/1971681.1971689(97-115)Online publication date: 28-Jun-2010
  • (1999)Agent-oriented programmingundefinedOnline publication date: 1-Jan-1999
  • (1996)Exploiting graph properties of game treesProceedings of the thirteenth national conference on Artificial intelligence - Volume 110.5555/1892875.1892910(234-239)Online publication date: 4-Aug-1996
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Artificial Intelligence
Artificial Intelligence  Volume 19, Issue 1
September 1982
127 pages

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 01 September 1982

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 23 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2010)Strategies for preparing computer science students for the multicore worldProceedings of the 2010 ITiCSE working group reports10.1145/1971681.1971689(97-115)Online publication date: 28-Jun-2010
  • (1999)Agent-oriented programmingundefinedOnline publication date: 1-Jan-1999
  • (1996)Exploiting graph properties of game treesProceedings of the thirteenth national conference on Artificial intelligence - Volume 110.5555/1892875.1892910(234-239)Online publication date: 4-Aug-1996
  • (1994)Studying overheads in massively parallel MIN/MAX-tree evaluationProceedings of the sixth annual ACM symposium on Parallel algorithms and architectures10.1145/181014.192325(94-103)Online publication date: 1-Aug-1994
  • (1994)Repeated Computation of Global Functions in a Distributed EnvironmentIEEE Transactions on Parallel and Distributed Systems10.1109/71.2982095:8(823-834)Online publication date: 1-Aug-1994
  • (1993)A bibliography on minimax treesACM SIGACT News10.1145/164996.16500724:4(82-89)Online publication date: 1-Dec-1993
  • (1990)Computational Efficiency of Parallel Combinatorial OR-Tree SearchesIEEE Transactions on Software Engineering10.1109/32.4436016:1(13-31)Online publication date: 1-Jan-1990
  • (1989)Searching game trees in parallel using SSS*Proceedings of the 11th international joint conference on Artificial intelligence - Volume 110.5555/1623755.1623762(42-47)Online publication date: 20-Aug-1989
  • (1989)On parallel evaluation of game treesProceedings of the first annual ACM symposium on Parallel algorithms and architectures10.1145/72935.72979(409-420)Online publication date: 1-Mar-1989
  • (1989)Chess on a hypercubeProceedings of the third conference on Hypercube concurrent computers and applications - Volume 210.1145/63047.63088(1329-1341)Online publication date: 3-Jan-1989
  • Show More Cited By

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media