Mark Brockington and Jonathan Schaeffer. APHID: Asynchronous Parallel Game-Tree Search , Journal of Parallel and Distributed Computing, vol. 60, pages 247273, 2000.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Transposition Table Driven Scheduling for Two-Player Games - Kishimoto (2002) (Correct)
.... Newborn s UIDPABS rst tried this approach in his chess program, but the speedups were worse than PV Split [33] However, Brockington s APHID, which generalizes UIDPABS, recently showed better speedups than YBWC in Othello and checkers, and comparable speedups to YBWC on two chess programs [8, 10]. Master Slave Slave Slave d ply d d d Figure 3.4: APHID APHID [8, 10] is constructed with a master processor and a series of slave processors (Figure 3.4) Roughly speaking, when conducting a d ply search, the master repeatedly searches the rst d ( d) ply of the game tree from the ....
....speedups were worse than PV Split [33] However, Brockington s APHID, which generalizes UIDPABS, recently showed better speedups than YBWC in Othello and checkers, and comparable speedups to YBWC on two chess programs [8, 10] Master Slave Slave Slave d ply d d d Figure 3. 4: APHID APHID [8, 10] is constructed with a master processor and a series of slave processors (Figure 3.4) Roughly speaking, when conducting a d ply search, the master repeatedly searches the rst d ( d) ply of the game tree from the root node, using the algorithm, while the slaves independently search the ....
[Article contains additional citation context not shown here]
M. G. Brockington and J. Schae er. APHID: Asynchronous Parallel Game-Tree Search. Journal of Parallel and Distributed Computing, 60:247-273, 2000.
Visualizing Object And Method Granularity For Program - Parallelization William Hui (2000) Self-citation (Schaeffer) (Correct)
No context found.
Mark Brockington and Jonathan Schaeffer. APHID: Asynchronous Parallel Game-Tree Search , Journal of Parallel and Distributed Computing, vol. 60, pages 247273, 2000.
Visualizing Object and Method Granularity for.. - Hui, MacDonald.. (2000) (1 citation) Self-citation (Schaeffer) (Correct)
....parallel tasks) then the master can expand that node to create more (smaller) pieces of work. In effect, the master now has a variable depth tree, where the deeper lines indicate more work. This type of analysis has been used for parallel alpha beta search, resulting in such a dynamic algorithm [11]. In this paper we have shown how Revy can quickly lead to the recognition that such a dynamic parallelization algorithm is necessary for maximum speed ups on a particular problem. Conclusions In this paper we have introduced Revy, a tool that can use sequential analysis of object oriented ....
Mark Brockington and Jonathan Schaeffer. APHID: Asynchronous Parallel Game-Tree Search , Journal of Parallel and Distributed Computing, vol. 60, pages 247273, 2000.
Asserting the Utility of CO2P3S Using the Cowichan Problems - Anvik (2003) (Correct)
No context found.
Mark Brockington and Jonathan Schae er. APHID: Asynchronous parallel game-tree search. Journal of Parallel and Distributed Computing, 60:247-273, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC