4-(N<sup>2</sup>-1) Puzzle: parallelization and performance on clusters

Autores
Sanz, Victoria María; De Giusti, Armando Eduardo; Naiouf, Marcelo
Año de publicación
2009
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
Presentado en el IX Workshop Procesamiento Distribuido y Paralelo (WPDP)
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Parallel algorithms
Optimization
multi-objective problems
discrete optimization
superlinearity
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/20906
Acceder
id SEDICI_d3ebaac44ee500e1b41fd4127dd9338f
oai_identifier_str oai:sedici.unlp.edu.ar:10915/20906
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling 4-(N<sup>2</sup>-1) Puzzle: parallelization and performance on clustersSanz, Victoria MaríaDe Giusti, Armando EduardoNaiouf, MarceloCiencias InformáticasParallel algorithmsOptimizationmulti-objective problemsdiscrete optimizationsuperlinearityIn this paper, an analysis of the 4-(N<sup>2</sup>-1) Puzzle, which is a generalization of the (N<sup>2</sup>-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 (N<sup>2</sup>-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-(N<sup>2</sup>-1) Puzzle is analyzed.Presentado en el IX Workshop Procesamiento Distribuido y Paralelo (WPDP)Red de Universidades con Carreras en Informática (RedUNCI)2009-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf231-240http://sedici.unlp.edu.ar/handle/10915/20906enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:54:26Zoai:sedici.unlp.edu.ar:10915/20906Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:54:26.843SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv 4-(N<sup>2</sup>-1) Puzzle: parallelization and performance on clusters
title 4-(N<sup>2</sup>-1) Puzzle: parallelization and performance on clusters
spellingShingle 4-(N<sup>2</sup>-1) Puzzle: parallelization and performance on clusters
Sanz, Victoria María
Ciencias Informáticas
Parallel algorithms
Optimization
multi-objective problems
discrete optimization
superlinearity
title_short 4-(N<sup>2</sup>-1) Puzzle: parallelization and performance on clusters
title_full 4-(N<sup>2</sup>-1) Puzzle: parallelization and performance on clusters
title_fullStr 4-(N<sup>2</sup>-1) Puzzle: parallelization and performance on clusters
title_full_unstemmed 4-(N<sup>2</sup>-1) Puzzle: parallelization and performance on clusters
title_sort 4-(N<sup>2</sup>-1) Puzzle: parallelization and performance on clusters
dc.creator.none.fl_str_mv Sanz, Victoria María
De Giusti, Armando Eduardo
Naiouf, Marcelo
author Sanz, Victoria María
author_facet Sanz, Victoria María
De Giusti, Armando Eduardo
Naiouf, Marcelo
author_role author
author2 De Giusti, Armando Eduardo
Naiouf, Marcelo
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Parallel algorithms
Optimization
multi-objective problems
discrete optimization
superlinearity
topic Ciencias Informáticas
Parallel algorithms
Optimization
multi-objective problems
discrete optimization
superlinearity
dc.description.none.fl_txt_mv In this paper, an analysis of the 4-(N<sup>2</sup>-1) Puzzle, which is a generalization of the (N<sup>2</sup>-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 (N<sup>2</sup>-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-(N<sup>2</sup>-1) Puzzle is analyzed.
Presentado en el IX Workshop Procesamiento Distribuido y Paralelo (WPDP)
Red de Universidades con Carreras en Informática (RedUNCI)
description In this paper, an analysis of the 4-(N<sup>2</sup>-1) Puzzle, which is a generalization of the (N<sup>2</sup>-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 (N<sup>2</sup>-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-(N<sup>2</sup>-1) Puzzle is analyzed.
publishDate 2009
dc.date.none.fl_str_mv 2009-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/20906
url http://sedici.unlp.edu.ar/handle/10915/20906
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
231-240
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844615801431130112
score 13.069144

Publicaciones similares