Massively Parallel Chess
Massively Parallel Chess
复制标题
大规模并行国际象棋
DOI：
--
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
Bradley C. Kuszmaul
中科院分区：
文献类型：
--
作者：
C. Joerg;Bradley C. Kuszmaul
计算机国际象棋提供了一个很好的测试床，用于了解动态MIMD风格的计算，以调查编程问题，我们设计了一个名为 *Socrates的平行象棋程序，该计划在NCSA的512处理器CM-5上运行，并在1994年ACM国际计算机中排名第三国际象棋冠军 *苏格拉底使用Jamboree算法并行搜索游戏树，并使用CILK 1.0语言和运行时系统来表达为了获得国际象棋的良好性能，我们使用了几种由CILK直接提供的机制，例如流产计算并直接访问主动消息层以实现整个处理器分布的全局转位表。 c的关键路径和总象棋程序的性能。高度h和d jamboree搜索中的平均可用并行性为θ（（d = 2）h = 2） *苏格拉底在比赛时间控制下搜索真实国际象棋树的平均可用并行性超过1000。
Computer chess provides a good testbed for understanding dynamic MIMD-style computations. To investigate the programming issues, we engineered a parallel chess program called *Socrates, which running on the NCSA’s 512 processor CM-5, tied for third in the 1994 ACM International Computer Chess Championship. *Socrates uses the Jamboree algorithm to search game trees in parallel and uses the Cilk 1.0 language and run-time system to express and to schedule the computation. In order to obtain good performance for chess, we use several mechanisms not directly provided by Cilk, such as aborting computations and directly accessing the active message layer to implement a global transposition table distributed across the processors. We found that we can use the critical path C and the total workW to predict the performance of our chess programs. Empirically *Socrates runs in timeT 0:95C+1:09W=P on P processors. For best-ordered uniform trees of height h and degree d the average available parallelism in Jamboree search is Θ((d=2)h=2). *Socrates searching real chess trees under tournament time controls yields average available parallelism of over 1000.