| Performance Characterization of Parallel Game-tree Search Application Crafty |
| |
| 作者姓名： | 谭膺 罗克露 陈玉荣 张益民 |
| |
| 作者单位： | [1]Intel China Research Center, Intel Corporation Beijing 100080 China [2]School of Computer Science and Engineering, University of Electronic Science and Technology of China Chengdu 610054 China |
| |
| 摘 要： | 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.
|
| 关 键 词： | 工作负荷 国际象棋 人工智能技术 多处理器 可测量性 |
| 收稿时间： | 2005-11-03 |
Performance Characterization of Parallel Game-tree Search Application Crafty |
| |
| TAN Ying,LUO Ke-lu,CHEN Yu-rong,ZHANG Yi-min.Performance Characterization of Parallel Game-tree Search Application Crafty[J].Journal of Electronic Science Technology of China,2006,4(2):155-160. |
| |
| Authors: | TAN Ying LUO Ke-lu CHEN Yu-rong ZHANG Yi-min |
| |
| Abstract: | 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. |
| |
| Keywords: | performance characterization workload analysis parallel game-tree search computer chess crafty |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
