Title :
Tree decomposition strategy for massively parallel game tree searching
Author :
Amarasinghe, S.K. ; Goh, W.L. ; He, S.
Author_Institution :
Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore
fDate :
10/1/1998 12:00:00 AM
Abstract :
A new tree decomposition strategy, EYBWC (enhanced young brothers wait concept), is proposed for two-player control game tree searching on massively parallel machines. Based on the YBWC (young brothers wait concept) which is one of the best existing tree decomposition strategies, this new strategy notably alleviates processor starvation in a massively parallel search by providing much many nodes for processors to search in parallel. An experiment on the Maspar MP-2 SIMD (single instruction multiple data) machine with 1024 processors shows that EYBWC is far more efficient than YBWC
Keywords :
parallel algorithms; tree searching; EYBWC; Maspar MP-2 SIMD machine; YBWC; enhanced young brothers wait concept; massively parallel game tree searching; single instruction multiple data machine; tree decomposition strategy; two-player control game tree searching; young brothers wait concept;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19981343
