| R. M. Hyatt and B. W. Suter. A parallel alpha/beta tree searching algorithm. Parallel Computing, 10:299--308, 1989. |
....measure of performance. By 1989 Schaeffer[30] reported on a dynamic tree splitting method under NMP in which idle machines were dynamically re assigned to busy processors. The performance curve for ParaPhoenix thus matched that obtained independently on a Sequent computer by Hyatt et al. 1989) [32], also plotted in Figure 8. Finally, the seemingly best result with that same Bratko Kopec test suite was obtained by Feldmann et al. 1990) 33] using a Transputer based system. However, although the speedup curve is impressive, and the testing results were comparable, there remain questions ....
R.M. Hyatt, B.W. Suter and H.L. Nelson, `A Parallel Alpha/Beta Tree Searching Algorithm', Parallel Computing, 10, 299-308 (1989).
....assignment is made. It is this static processor allocation mechanism that leads to load imbalance. Later more dynamic processor allocation schemes were developed. Notable are Schaeffer s Dynamic PVSplit algorithm [20] and the Enhanced Principal Variation Splitting (EPVS) method of Hyatt et al. [11]. Schaeffer s distributed search introduced dynamic work assignments. In his algorithm there is one Controller Process to allocate work to Searcher processes that use PVSplit to do the searching. When the Controller has no other work to allocate it reassigns an idle Searcher to help others. The ....
R.M. Hyatt, B.W. Suter, and H.L. Nelson. A parallel alpha-beta tree searching algorithm. Parallel Computing, 10(3):299--308, 1989.
No context found.
R. M. Hyatt and B. W. Suter. A parallel alpha/beta tree searching algorithm. Parallel Computing, 10:299--308, 1989.
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