4-(<i>N<SUP>2</SUP></i>-1) puzzle: parallelization and performance on clusters
In this paper, an analysis of the 4-(<i>N<SUP>2</SUP></i>-1) Puzzle, which is a generalization of the (<i>N<SUP>2</SUP></i>-1) Puzzle, is presented. This problem is of interest due to its algorithmic and computational complexity and its applications to...
Guardado en:
| Autores principales: | Sanz, Victoria María, De Giusti, Armando Eduardo, Naiouf, Marcelo |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2010
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/9674 http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Jun10-7.pdf |
| Aporte de: |
Ejemplares similares
-
4-(N<sup>2</sup>-1) Puzzle: parallelization and performance on clusters
por: Sanz, Victoria María, et al.
Publicado: (2009) -
Superlinealidad sobre Clusters : Análisis experimental en el problema del Puzzle N<sup>2</sup> -1
por: Chichizola, Franco, et al.
Publicado: (2007) -
Performance analysis and optimization of parallel Best-First Search algorithms on multicore and cluster of multicore
por: Sanz, Victoria María
Publicado: (2016) -
A general framework to understand parallel performance in heterogeneous clusters: Analysis of a new adaptive parallel genetic algorithm
por: Bazterra, V.E., et al. -
A general framework to understand parallel performance in heterogeneous clusters: Analysis of a new adaptive parallel genetic algorithm
por: Bazterra, Víctor Eduardo, et al.
Publicado: (2005)