|
|
|
|
| LEADER |
00000naa a2200000 a 4500 |
| 003 |
AR-LpUFIB |
| 005 |
20250311170416.0 |
| 008 |
230201s2008 xx o 000 0 eng d |
| 024 |
8 |
|
|a DIF-M6487
|b 6626
|z DIF005918
|
| 040 |
|
|
|a AR-LpUFIB
|b spa
|c AR-LpUFIB
|
| 100 |
1 |
|
|a Sanz, Victoria María
|
| 245 |
1 |
0 |
|a Parallel processing puzzle N2-1 on cluster architectures performance analysis
|
| 300 |
|
|
|a 1 archivo (159,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 An analysis of a parallel solution of N2-1 puzzle using clusters, is presented. This problem is interesting due to its complexity and related applications, particularly in the field of robotics. A variation of classic heuristics for forecasting the work to be done in order to reach a solution is analyzed, and it is shown that its use significantly improves the time of sequential algorithm A . Then, a parallel solution on a distributed architecture is presented and speedup is analyzed based on the number of processors, efficiency, and the possible superlinearity when scaling the problem.
|
| 534 |
|
|
|a International Conference on Information Technology Interfaces (30th : 2008 : Cavtat, Croacia) IEEE; pp. 879-884.
|
| 650 |
|
4 |
|a PROCESAMIENTO DISTRIBUIDO
|
| 650 |
|
4 |
|a ALGORITMOS PARALELOS
|
| 700 |
1 |
|
|a De Giusti, Armando Eduardo
|
| 700 |
1 |
|
|a Chichizola, Franco
|
| 700 |
1 |
|
|a Naiouf, Ricardo Marcelo
|
| 700 |
1 |
|
|a De Giusti, Laura Cristina
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/ITI.2008.4588527
|
| 942 |
|
|
|c CP
|
| 952 |
|
|
|0 0
|1 0
|4 0
|6 A0258
|7 3
|8 BD
|9 80868
|a DIF
|b DIF
|d 2025-03-11
|l 0
|o A0258
|r 2025-03-11 17:04:16
|u http://catalogo.info.unlp.edu.ar/meran/getDocument.pl?id=516
|w 2025-03-11
|y CP
|
| 999 |
|
|
|c 55700
|d 55700
|
