4-(N2-1) Puzzle : parallelization and performance on clusters

Detalles Bibliográficos
Autor Principal: Sanz, Victoria María
Otros autores o Colaboradores: De Giusti, Armando Eduardo, Naiouf, Ricardo Marcelo
Formato: Capítulo de libro
Lengua:inglés
Temas:
Acceso en línea:http://goo.gl/KviyXB
Consultar en el Cátalogo
Resumen:In this paper, an analysis of the 4-(N2-1) Puzzle, which is a generalization of the (N2-1) Puzzle, is presented. This problem is of interest due to its algorithmic and computational complexity and its applications to robot movements with several objectives. Taking the formal definition as a starting point, 4 heuristics that can be used to predict the best achievable objective and to estimate the number of steps required to reach a solution state from a given configuration are analyzed. By selecting the objective, a sequential and parallel solution over a cluster is presented for the (N2-1) Puzzle, based on the heuristic search algorithm A*. Also, variations of the classic heuristic are analyzed. The experimental work focuses on analyzing the possible superlinearity and the scalability of the parallel solution on clusters, by varying the physical configuration and the dimension of the problem. Finally, the suitability of the heuristic used to assess the best achievable objective in the 4-(N2-1) Puzzle is analyzed.
Notas:Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática - UNLP (Colección BIPA/Biblioteca)
Descripción Física:1 archivo (276,4 KB)

MARC

LEADER 00000naa a2200000 a 4500
003 AR-LpUFIB
005 20250311170247.0
008 230201s2009 xx o 000 0 eng d
024 8 |a DIF-M6679  |b 6816  |z DIF002554 
040 |a AR-LpUFIB  |b spa  |c AR-LpUFIB 
100 1 |a Sanz, Victoria María 
245 1 0 |a 4-(N2-1) Puzzle :  |b parallelization and performance on clusters 
300 |a 1 archivo (276,4 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 In this paper, an analysis of the 4-(N2-1) Puzzle, which is a generalization of the (N2-1) Puzzle, is presented. This problem is of interest due to its algorithmic and computational complexity and its applications to robot movements with several objectives. Taking the formal definition as a starting point, 4 heuristics that can be used to predict the best achievable objective and to estimate the number of steps required to reach a solution state from a given configuration are analyzed. By selecting the objective, a sequential and parallel solution over a cluster is presented for the (N2-1) Puzzle, based on the heuristic search algorithm A*. Also, variations of the classic heuristic are analyzed. The experimental work focuses on analyzing the possible superlinearity and the scalability of the parallel solution on clusters, by varying the physical configuration and the dimension of the problem. Finally, the suitability of the heuristic used to assess the best achievable objective in the 4-(N2-1) Puzzle is analyzed. 
534 |a Congreso Argentino de Ciencias de la Computación (25to. : 2009 oct : Jujuy), pp. 231-240 
650 4 |a OPTIMIZACIÓN 
650 4 |a ALGORITMOS PARALELOS 
700 1 |a De Giusti, Armando Eduardo 
700 1 |a Naiouf, Ricardo Marcelo 
856 4 0 |u http://goo.gl/KviyXB 
942 |c CP 
952 |0 0  |1 0  |4 0  |6 A0424  |7 3  |8 BD  |9 76996  |a DIF  |b DIF  |d 2025-03-11  |l 0  |o A0424  |r 2025-03-11 17:02:47  |u http://catalogo.info.unlp.edu.ar/meran/getDocument.pl?id=704  |w 2025-03-11  |y CP 
999 |c 52433  |d 52433