Sciweavers

Share
TPDS
2002

Analysis of Transposition-Table-Driven Work Scheduling in Distributed Search

8 years 5 months ago
Analysis of Transposition-Table-Driven Work Scheduling in Distributed Search
This paper discusses a new work-scheduling algorithm for parallel search of single-agent state spaces, called Transposition-Table-Driven Work Scheduling, that places the transposition table at the heart of the parallel work scheduling. The scheme results in less synchronization overhead, less processor idle time, and less redundant search effort. Measurements on a 128-processor parallel machine show that the scheme achieves close-to-linear speedups; for large problems the speedups are
John W. Romein, Henri E. Bal, Jonathan Schaeffer,
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where TPDS
Authors John W. Romein, Henri E. Bal, Jonathan Schaeffer, Aske Plaat
Comments (0)
books