Parallel processing puzzle N2-1 on cluster architectures performance analysis

Título:

Parallel processing puzzle N2-1 on cluster architectures performance analysis

Autor:

Sanz, Victoria María

Colaboradores:

; De Giusti, Armando Eduardo; Chichizola, Franco; Naiouf, Ricardo Marcelo; De Giusti, Laura Cristina

Temas:

PROCESAMIENTO DISTRIBUIDOALGORITMOS PARALELOS

En:

International Conference on Information Technology Interfaces (30th : 2008 : Cavtat, Croacia) IEEE; pp. 879-884.

Resumen:

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.

URL/DOI:

http://dx.doi.org/10.1109/ITI.2008.4588527

Medio:

Soporte electrónico

Tipo de documento:

Artículo

Descripción física:

1 archivo (159,7 kB)

Idioma:

Inglés

Publicación:

IEEE Press, 2008

Puede solicitar más fácilmente el ejemplar con: A0258

Ver estantes