Parallelism in Alpha-Beta Search
暂无分享,去创建一个
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.
[1] Donald E. Knuth,et al. An Analysis of Alpha-Beta Pruning , 1975, Artif. Intell..
[2] Gerard Maurice Baudet,et al. The design and analysis of algorithms for asynchronous multiprocessors. , 1978 .
[3] Marvin H. Solomon,et al. The Roscoe distributed operating system , 1979, SOSP '79.
[4] Hans J. Berliner,et al. A Chronology of Computer Chess and its Literature , 1978, Artif. Intell..
[5] Per Brinch Hansen,et al. Distributed processes: a concurrent programming concept , 1978, CACM.