Consistent linear speedups to a first solution in parallel state-space search

Authors:
Vikram A. Saletore;L. V. Kalé
Affiliations:
Department of Computer Science, University Of lllinois at Urbana-Champaign, Urbana, lllinois;Department of Computer Science, University Of lllinois at Urbana-Champaign, Urbana, lllinois
Venue:
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Year:
1990

Citing 6
Cited 0

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
Parallel Symbolic Computing

Computer
Parallel depth first search. Part I. implementation

International Journal of Parallel Programming
Optimal path-finding algorithms*

Search in Artificial Intelligence
Anomalies in parallel branch-and-bound algorithms

Communications of the ACM
Superlinear Speedup in Parallel State-Space Search

Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider the problem of exploring a large state-space for a goal state. Although many such states may exist, finding anyone state satisfying the requirements is sufficient. All methods known until now for conducting such search in parallel fail to provide consistent linear speedups over sequential execution. The speedups vary between sublinear to superlinear and from run to run. Further, adding processors may sometimes lead to a slow-down rather than speedup, giving rise to speedup anomalies. We present prioritizing strategies which yield consistent linear speedups and requires substantially smaller memory over other methods. The performance of these strategies is demonstrated on a multiprocessor.