PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE

DOI10.1142/S0129626411000242zbMath1253.68062OpenAlexW1966914474MaRDI QIDQ3144924

Gengbin Zheng, Yanhua Sun, Pritish Jetley, Laxmikant V. Kalé

Publication date: 12 December 2012

Published in: Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129626411000242

zbMATH Keywords

dynamic load balancingadaptive grain size controlparallel state space searchprioritized execution

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed systems (68M14)

Related Items

FiberSCIP—A Shared Memory Parallelization of SCIP, ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers, A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers

Uses Software

• CHARM++
• ParSSSE

Cites Work

• Parallel state-space search for a first solution with consistent linear speedups
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• The reduce-or process model for parallel execution of logic programs
• Anomalies in parallel branch-and-bound algorithms
• Generalized best-first search strategies and the optimality of A*
• An Algorithm for the Traveling Salesman Problem