Parallel state-space search for a first solution with consistent linear speedups
Book
·
OSTI ID:6472322
- Univ. of Illinois at Urbana-Champaign, IL (US)
Consider the problem of exploring a large state-space for a goal state. Although many such states may exist in the state-space, finding any one state satisfying the requirements is sufficient. All the methods known until now for conducting such search in parallel using multiprocessors fail to provide consistent linear speedups over sequential execution. The speedups vary between sub-linear speedups over sequential execution. The speedup, giving rise to speedup anomalies reported in literature. The authors present a prioritizing strategy which yields consistent speedups that are close to P with P processors, and that monotonically increase with the addition of processors. It achieves this by keeping the total number of nodes expanded during parallel search very close to that in a sequential search. In addition, the strategy requires substantially smaller memory over other methods. The performance of this strategy is demonstrated on a multiprocessor with several state-space search problems.
- OSTI ID:
- 6472322
- Country of Publication:
- United States
- Language:
- English
Similar Records
Consistent first solution speedups in OR-parallel execution of logic programs
Speedup bounds and processor allocation for parallel programs on multiprocessors
Problem size, parallel architecture, and optimal speedup
Book
·
Sun Dec 31 23:00:00 EST 1989
·
OSTI ID:5693102
Speedup bounds and processor allocation for parallel programs on multiprocessors
Conference
·
Fri Jan 31 23:00:00 EST 1986
·
OSTI ID:7163000
Problem size, parallel architecture, and optimal speedup
Journal Article
·
Mon Aug 01 00:00:00 EDT 1988
· J. Parallel Distrib. Comput.; (United States)
·
OSTI ID:6214660