Performance analysis and optimization of parallel Best-First Search algorithms on multicore and cluster of multicore
The contribution of the thesis is the development of two parallel Best-First Search algorithms, one that is suitable for execution on shared-memory machines (multicore), and another one that is suitable for execution on distributed memory machines (cluster). The former is based on the adaptation of the HDA* (Hash Distributed A*) algorithm for multicore machines proposed by (Burns et al., 2010), while the latter is based on the HDA* (Hash Distributed A*) algorithm proposed by (Kishimoto, et al., 2013). The implemented algorithms incorporate parameters and/or techniques that improve their performance, with respect to the original algorithms proposed by the authors mentioned above.
Journal of Artificial Intelligence Research, Vol. 39, pp. 689-743.
 Hart, P., Nilsson, N. & Raphael, B., 1968. A Formal Basis for the Heuristic Determination of Minimum
Cost Paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), pp. 100-107.
 Kishimoto, A., Fukunaga, A. & Botea, A., 2013. Evaluation of a simple, scalable, parallel Best-First
Search strategy. Artificial Intelligence, Vol. 195, pp. 222–248.
 Russel, S. & Norvig, P., 2003. Artificial Intelligence: A Modern Approach. Second edition. NJ: Prentice
 Sanz, V. M., 2015. Análisis de rendimiento y optimización de algoritmos paralelos Best-First Search
sobre multicore y cluster de multicore.
Available at: http://sedici.unlp.edu.ar/handle/10915/44478