Performance Characterization of Parallel Game-tree Search Application Crafty

Ying Tan、Luo Ke-lu、Yurong Chen、Yimin Zhang

2006中国电子科技：英文版Computer Science被引 1

摘要

Game-tree search plays an important role in the field of Artificial Intelligence (AI). In this paper, we characterize one parallel game-tree search workload in chess: the latest version of Crafty, a state of art program, on two Intel Xeon® shared-memory multiprocessor systems. Our analysis shows that Crafty is latency-sensitive and the hash-table and dynamic tree splitting used in Crafty cause large scalability penalties. They consume 35%-50% of the running time on the 4-way system. Furthermore, Crafty is not bandwidth-limited.

引用本文（GB/T 7714）

Ying Tan, Luo Ke-lu, Yurong Chen, 等. Performance Characterization of Parallel Game-tree Search Application Crafty[J]. 中国电子科技：英文版, 2006.

引文网络

参考文献与被引分析加载中…

本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。