|
|
|
|
| LEADER |
00000naa a2200000 a 4500 |
| 003 |
AR-LpUFIB |
| 005 |
20250311170448.0 |
| 008 |
230201s2014 xx r 000 0 eng d |
| 024 |
8 |
|
|a DIF-M7600
|b 7820
|z DIF006946
|
| 040 |
|
|
|a AR-LpUFIB
|b spa
|c AR-LpUFIB
|
| 100 |
1 |
|
|a Sanz, Victoria María
|
| 245 |
1 |
0 |
|a On the Optimization of HDA* for Multicore Machines :
|b performance analysis
|
| 300 |
|
|
|a 1 archivo (578,7 kB)
|
| 500 |
|
|
|a Formato de archivo PDF. -- Este documento es producción intelectual de la Facultad de Informática - UNLP (Colección BIPA/Biblioteca)
|
| 520 |
|
|
|a Combinatorial optimization problems are interesting due to their complexity and applications, particularly in robotics. This paper deals with a parallel algorithm suitable for shared memory architectures, based on the HDA* algorithm (Hash Distributed A*), which allows finding solutions to combinatorial optimization problems. The implementation was carried out using the shared memory programming tools provided by the Pthreads library, the Jemalloc memory allocator and taking the N2-1 Puzzle as study case. The experimental work focuses on analyzing the speedup and efficiency achieved by the parallel algorithm when running on a computer with multi-core processors, for different instances of the problem and varying the amount of threads/cores used. Finally, the scalability obtained with increasing workload and number of threads/cores used is analyzed.
|
| 534 |
|
|
|a PDPTA ཊ - The 2014 International Conference on Parallel and Distributed Processing Techniques and Applications (2014 : Las Vegas, Estados Unidos)
|
| 650 |
|
4 |
|a PROGRAMACIÓN
|
| 700 |
1 |
|
|a De Giusti, Armando Eduardo
|
| 700 |
1 |
|
|a Naiouf, Ricardo Marcelo
|
| 942 |
|
|
|c CP
|
| 952 |
|
|
|0 0
|1 0
|4 0
|6 A0822
|7 3
|8 BD
|9 82145
|a DIF
|b DIF
|d 2025-03-11
|l 0
|o A0822
|r 2025-03-11 17:04:48
|u http://catalogo.info.unlp.edu.ar/meran/getDocument.pl?id=1518
|w 2025-03-11
|y CP
|
| 999 |
|
|
|c 56722
|d 56722
|
