Parallel depth first vs. work stealing schedulers on CMP architectures.
Vasileios LiaskovitisShimin ChenPhillip B. GibbonsAnastassia AilamakiGuy E. BlellochBabak FalsafiLimor FixNikos HardavellasMichael KozuchTodd C. MowryChris WilkersonPublished in: SPAA (2006)
Keyphrases
- depth first search
- search algorithm
- search tree
- parallel architectures
- search strategy
- parallel processing
- parallel implementations
- search space
- parallel implementation
- parallel computers
- iterative deepening
- parallel execution
- branch and bound
- shared memory
- distributed computing
- distributed memory machines
- parallel computation
- parallel computing
- information retrieval
- constraint satisfaction problems
- general purpose
- information systems
- search engine