TY  - GEN
T1  - Parallel processing puzzle N2-1 on cluster architectures performance analysis
A1  - Sanz, Victoria María
A2  - De Giusti, Armando Eduardo
A2  - Chichizola, Franco
A2  - Naiouf, Ricardo Marcelo
A2  - De Giusti, Laura Cristina
LA  - English
UL  - https://catalogo.bibliotecas.unlp.edu.ar/Record/dif.55700
AB  - 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.
NO  - Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática-UNLP (Colección BIPA / Biblioteca.)
KW  - PROCESAMIENTO DISTRIBUIDO
KW  - ALGORITMOS PARALELOS
ER  -