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

Autores
Sanz, Victoria María; de Giusti, Armando Eduardo; Naiouf, Ricardo 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.
Fil: Sanz, Victoria María. Universidad Nacional de La Plata. Facultad de Informática. Instituto de Investigación en Informática Lidi; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; Argentina
Fil: de Giusti, Armando Eduardo. Universidad Nacional de La Plata. Facultad de Informática. Instituto de Investigación en Informática Lidi; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; Argentina
Fil: Naiouf, Ricardo Marcelo. Universidad Nacional de La Plata. Facultad de Informática. Instituto de Investigación en Informática Lidi; Argentina
Materia
Multi-objective problems
discrete optimization
superlinearity
parallel algorithms
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/237392
Acceder
id CONICETDig_49a47ffc3cc5e13bc6941c6fa47102e4
oai_identifier_str oai:ri.conicet.gov.ar:11336/237392
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling 4-(N2-1) Puzzle: Parallelization and performance on clustersSanz, Victoria Maríade Giusti, Armando EduardoNaiouf, Ricardo MarceloMulti-objective problemsdiscrete optimizationsuperlinearityparallel algorithmshttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1In 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.Fil: Sanz, Victoria María. Universidad Nacional de La Plata. Facultad de Informática. Instituto de Investigación en Informática Lidi; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; ArgentinaFil: de Giusti, Armando Eduardo. Universidad Nacional de La Plata. Facultad de Informática. Instituto de Investigación en Informática Lidi; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; ArgentinaFil: Naiouf, Ricardo Marcelo. Universidad Nacional de La Plata. Facultad de Informática. Instituto de Investigación en Informática Lidi; ArgentinaScience Press2010-06info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/237392Sanz, Victoria María; de Giusti, Armando Eduardo; Naiouf, Ricardo Marcelo; 4-(N2-1) Puzzle: Parallelization and performance on clusters; Science Press; Journal of Computer Science and Technology; 10; 2; 6-2010; 86-901000-9000CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://journal.info.unlp.edu.ar/JCST/article/view/732info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T10:13:13Zoai:ri.conicet.gov.ar:11336/237392instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 10:13:13.356CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv 4-(N2-1) Puzzle: Parallelization and performance on clusters
title 4-(N2-1) Puzzle: Parallelization and performance on clusters
spellingShingle 4-(N2-1) Puzzle: Parallelization and performance on clusters
Sanz, Victoria María
Multi-objective problems
discrete optimization
superlinearity
parallel algorithms
title_short 4-(N2-1) Puzzle: Parallelization and performance on clusters
title_full 4-(N2-1) Puzzle: Parallelization and performance on clusters
title_fullStr 4-(N2-1) Puzzle: Parallelization and performance on clusters
title_full_unstemmed 4-(N2-1) Puzzle: Parallelization and performance on clusters
title_sort 4-(N2-1) Puzzle: Parallelization and performance on clusters
dc.creator.none.fl_str_mv Sanz, Victoria María
de Giusti, Armando Eduardo
Naiouf, Ricardo Marcelo
author Sanz, Victoria María
author_facet Sanz, Victoria María
de Giusti, Armando Eduardo
Naiouf, Ricardo Marcelo
author_role author
author2 de Giusti, Armando Eduardo
Naiouf, Ricardo Marcelo
author2_role author
author
dc.subject.none.fl_str_mv Multi-objective problems
discrete optimization
superlinearity
parallel algorithms
topic Multi-objective problems
discrete optimization
superlinearity
parallel algorithms
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv 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.
Fil: Sanz, Victoria María. Universidad Nacional de La Plata. Facultad de Informática. Instituto de Investigación en Informática Lidi; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; Argentina
Fil: de Giusti, Armando Eduardo. Universidad Nacional de La Plata. Facultad de Informática. Instituto de Investigación en Informática Lidi; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; Argentina
Fil: Naiouf, Ricardo Marcelo. Universidad Nacional de La Plata. Facultad de Informática. Instituto de Investigación en Informática Lidi; Argentina
description 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.
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
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://hdl.handle.net/11336/237392
Sanz, Victoria María; de Giusti, Armando Eduardo; Naiouf, Ricardo Marcelo; 4-(N2-1) Puzzle: Parallelization and performance on clusters; Science Press; Journal of Computer Science and Technology; 10; 2; 6-2010; 86-90
1000-9000
CONICET Digital
CONICET
url http://hdl.handle.net/11336/237392
identifier_str_mv Sanz, Victoria María; de Giusti, Armando Eduardo; Naiouf, Ricardo Marcelo; 4-(N2-1) Puzzle: Parallelization and performance on clusters; Science Press; Journal of Computer Science and Technology; 10; 2; 6-2010; 86-90
1000-9000
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://journal.info.unlp.edu.ar/JCST/article/view/732
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Science Press
publisher.none.fl_str_mv Science Press
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1844614046466179072
score 13.069144

Publicaciones similares