Kuszmaul, B. C. (1994). Synchronized MIMD Computing. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Taxonomy Of Parallel Game-Tree Search Algorithms - Brockington (1996) (1 citation) (Correct)
.... Type 1 3 Bad Type 2 (Hsu, 1990) Centralized Frontier Splitting 1993 Dynamic All Root (Lu, 1993) Distributed fffi 1993 Dynamic Type 1 3 Type 1 3 Bad 2 (David, 1993) Distributed CABP 1994 Static Type 1 3 Bad Type 2 (Cung, 1994) Centralized Jamboree 1994 Dynamic Type 1 3 Bad 2 Type 1 Bad 2 (Kuszmaul, 1994) Distributed ABDADA 1995 Dynamic Type 1 3 Bad 2 Type 1 Bad 2 (Weill, 1995) Distributed Dynamic Multiple PV Split 1995 Dynamic Nodes within Nodes within (Marsland and Gao, 1995) Distributed PV set PV set APHID 1996 Static Top k ply None (Brockington and Schaeffer, 1996) Centralized Table 1: ....
....Splitting BBN Checkers NegaScout shared 3.32 (n=16) Lu, 1993) TC2000 memory fffi Transputers Chess NegaScout distributed 6.5 (n=8 8TT) David, 1993) messages CABP Sequent Artificial fffi shared 4. 6 (n=9) Cung, 1994) Balance Trees memory Jamboree CM 5 Chess NegaScout distributed 50 (n=512) (Kuszmaul, 1994) messages ABDADA CM 5 Chess NegaScout distributed 15.85 (n=32) Weill, 1996) Othello) messages Dynamic Multiple PV Split AP 1000 Artificial PVS none 32 (n=64) Marsland and Gao, 1995) Trees APHID Sparc 2 Chess NegaScout local 6.04 (n=16) Brockington and Schaeffer, 1995) Network Table 2: ....
[Article contains additional citation context not shown here]
Kuszmaul, B. C. (1994). Synchronized MIMD Computing. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA.
Speculative Parallelism Improves Search? - Marsland, Gao (1995) (2 citations) (Correct)
....have been tried, including parallel window search, search tree partitioning, and principal variation splitting, the potential remains for significantly better parallelization methods. For massively parallel systems, the exisitng approaches exhibit only acceptable efficiency both in practice [5] [13], and by simulation [10] Here, we address the issues of parallel game tree search and present a new parallel algorithm, called Dynamic Multiple Principal Variation Splitting (DM PVSplit) Our algorithm first defines a critical node set and spawns those nodes for parallel search. It then splits ....
B. Kuszmaul. Synchronized MIMD Computing. PhD thesis, Dept. of Computer Science, MIT, 1994.
The APHID Parallel - Search Algorithm (Correct)
....been searched and no cut off occurred, the rest can likely be searched in parallel. It is a trade off increased parallelism versus additional search overhead, since one of these parallel tasks could cause a cut off. This idea has been tried by a number of researchers, such as Jamboree search [4] and ABDADA [9] The best known instance of this type of algorithm is called Young Brothers Wait (YBW) and was implemented in the Zugzwang chess program [3] YBW achieved a 344fold speedup using a network of 1024 Transputers. This class of algorithms cannot achieve a linear speedup primarily due ....
B. C. Kuszmaul. SynchronizedMIMD Computing. PhD thesis, M.I.T., Cambridge, MA, 1994.
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