4-(<i>N<SUP>2</SUP></i>-1) puzzle: parallelization and performance on clusters
- Autores
- Sanz, Victoria María; De Giusti, Armando Eduardo; Naiouf, Marcelo
- Año de publicación
- 2010
- Idioma
- inglés
- Tipo de recurso
- artículo
- 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.
Facultad de Informática - Materia
-
Ciencias Informáticas
Parallel algorithms
Optimization - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc/3.0/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/9674
Ver los metadatos del registro completo
| id |
SEDICI_0ef8c69e4bec513861c015b9f52b9f42 |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/9674 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
4-(<i>N<SUP>2</SUP></i>-1) puzzle: parallelization and performance on clustersSanz, Victoria MaríaDe Giusti, Armando EduardoNaiouf, MarceloCiencias InformáticasParallel algorithmsOptimizationIn 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 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 (<i>N<SUP>2</SUP></i>-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-(<i>N<SUP>2</SUP></i>-1) Puzzle is analyzed.Facultad de Informática2010-06info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf86-90http://sedici.unlp.edu.ar/handle/10915/9674enginfo:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Jun10-7.pdfinfo:eu-repo/semantics/altIdentifier/issn/1666-6038info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc/3.0/Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:50:45Zoai:sedici.unlp.edu.ar:10915/9674Institucionalhttp://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:50:45.278SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
4-(<i>N<SUP>2</SUP></i>-1) puzzle: parallelization and performance on clusters |
| title |
4-(<i>N<SUP>2</SUP></i>-1) puzzle: parallelization and performance on clusters |
| spellingShingle |
4-(<i>N<SUP>2</SUP></i>-1) puzzle: parallelization and performance on clusters Sanz, Victoria María Ciencias Informáticas Parallel algorithms Optimization |
| title_short |
4-(<i>N<SUP>2</SUP></i>-1) puzzle: parallelization and performance on clusters |
| title_full |
4-(<i>N<SUP>2</SUP></i>-1) puzzle: parallelization and performance on clusters |
| title_fullStr |
4-(<i>N<SUP>2</SUP></i>-1) puzzle: parallelization and performance on clusters |
| title_full_unstemmed |
4-(<i>N<SUP>2</SUP></i>-1) puzzle: parallelization and performance on clusters |
| title_sort |
4-(<i>N<SUP>2</SUP></i>-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 |
| topic |
Ciencias Informáticas Parallel algorithms Optimization |
| dc.description.none.fl_txt_mv |
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 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 (<i>N<SUP>2</SUP></i>-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-(<i>N<SUP>2</SUP></i>-1) Puzzle is analyzed. Facultad de Informática |
| description |
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 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 (<i>N<SUP>2</SUP></i>-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-(<i>N<SUP>2</SUP></i>-1) Puzzle is analyzed. |
| publishDate |
2010 |
| dc.date.none.fl_str_mv |
2010-06 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion Articulo http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
| format |
article |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/9674 |
| url |
http://sedici.unlp.edu.ar/handle/10915/9674 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Jun10-7.pdf info:eu-repo/semantics/altIdentifier/issn/1666-6038 |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc/3.0/ Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc/3.0/ Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) |
| dc.format.none.fl_str_mv |
application/pdf 86-90 |
| 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_ |
1844615758822244352 |
| score |
13.069144 |