Parallel state-space search for a first solution with consistent linear speedups

DOI10.1007/BF01379360zbMath0723.68043OpenAlexW2048871993MaRDI QIDQ757044

Vikram A. Saletore, Laxmikant V. Kalé

Publication date: 1990

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01379360

zbMATH Keywords

first solutionlinear speedupsparallel depth-first searchstate-space trees

Mathematics Subject Classification ID

Data structures (68P05) Distributed algorithms (68W15)

Related Items

Performances of parallel branch and bound algorithms with best-first search, An almost perfect heuristic for the N nonattacking queens problem, Parallel processing for difficult combinatorial optimization problems, PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE

Uses Software

• MACSYMA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Depth-first iterative-deepening: An optimal admissible tree search
• Parallel depth first search. I: Implementation
• Parallel depth first search. II: Analysis
• Anomalies in parallel branch-and-bound algorithms
• Concurrent access of priority queues
• Backtrack programming techniques
• Symbolic integration