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

DOI10.1080/17445761003604521MaRDI QIDQ3072379zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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)

Recommendations

• Publication:3489493
• Best-first heuristic search for multicore machines
• Publication:3489452
• Evaluation of a simple, scalable, parallel best-first search strategy
• Multithreaded constraint programming: A hybrid approach

Cites work

• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗
• Depth-first iterative-deepening: An optimal admissible tree search
• Disjoint pattern database heuristics
• IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH
• ISRL: intelligent search by reinforcement learning in unstructured peer-to-peer networks
• Introduction to algorithms
• Multithreaded constraint programming: A hybrid approach
• On the asymptotic performance of IDA
• Parallel depth first search. I: Implementation
• The traveling salesman problem. A computational study.
• \(\text{BIDA}^*\): An improved perimeter search algorithm

Cited in

(1)

• Performance of a knight tour parallel algorithm on multi-core system using OpenMP

Describes a project that uses

Uses Software

• pthreads
• Concorde

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3072379)