H-PBS: a hash-based scalable technique for parallel bidirectional search

Keyphrases

• 15-puzzle 100%
• Bidirectional Search 100%
• Communication Latency 50%
• Distributed Memory multiprocessors 100%
• EM-4 50%
• Execution Time 50%
• Fast Communication 50%
• Hash Algorithm 50%
• Hash-based 100%
• Hashing 100%
• In(III) 50%
• Large Problem Size 50%
• Limited Memory 50%
• Linear Speedup 50%
• Load Balancing 50%
• Massive Parallelism 50%
• Memory Capacity 50%
• Multiprocessor 50%
• Node number 50%
• Optimal Path Length 50%
• Optimal Speed 50%
• Parallel Machines 50%
• Path Length 50%
• Popular 50%
• Problem Instances 100%
• Scalable Technique 100%
• Search Problems 50%
• Solution Path 50%
• Super-Linear Speedup 50%
• Superlinear 50%

Computer Science

• Bidirectional Search 100%
• Communication Latency 50%
• Distributed Memory (Multiprocessor) 100%
• Execution Time 50%
• Hashing 100%
• Large Problem Size 50%
• Load Balancing 50%
• Memory Capacity 50%
• multi-processor 50%
• Parallel Machine 50%
• Parallelism 50%
• Problem Instance 100%