Transposition Table Driven Work Scheduling in Distributed Search

This paper introduces a new scheduling algorithm for parallel single-agent search, 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 nearly-optimal performance and scales well. The algorithm performs a factor of 2. 0 to 13. 7 times better than traditional work-stealing-based schemes.

Authors

• John W. Romein
• Aske Plaat
• Henri E. Bal
• Vrije Universiteit; Jonathan Schaeffer
• University of Alberta

Keywords

No keywords are indexed for this paper.