Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation

DOI10.1080/17445761003604521zbMath1209.68176OpenAlexW2051659302WikidataQ58215145 ScholiaQ58215145MaRDI QIDQ3072379

Basel A. Mahafzah

Publication date: 3 February 2011

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17445761003604521

zbMATH Keywords

performance evaluationheuristic searchIDA\(*\) algorithmmultithreaded IDA\(*\)parallel IDA\(*\)

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Uses Software

• Concorde
• pthreads

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
• On the asymptotic performance of IDA
• \(\text{BIDA}^*\): An improved perimeter search algorithm
• IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH
• A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗
• ISRL: intelligent search by reinforcement learning in unstructured peer-to-peer networks
• Disjoint pattern database heuristics

This page was built for publication: Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation