Parallel processing puzzle N2-1 on cluster architectures performance analysis
Sanz, Victoria María
Parallel processing puzzle N2-1 on cluster architectures performance analysis - ref_localidad@NULL : IEEE, 2008 - 1 archivo (159,7 kB)
Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática-UNLP (Colección BIPA / Biblioteca.)
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.
DIF005907
PROCESAMIENTO DISTRIBUIDO
ALGORITMOS PARALELOS
Parallel processing puzzle N2-1 on cluster architectures performance analysis - ref_localidad@NULL : IEEE, 2008 - 1 archivo (159,7 kB)
Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática-UNLP (Colección BIPA / Biblioteca.)
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.
DIF005907
PROCESAMIENTO DISTRIBUIDO
ALGORITMOS PARALELOS