A parallel search algorithm for the SAT

Autores
Gil Costa, Graciela Verónica; Printista, Alicia Marcela; Reyes, Nora Susana; Marin Cahiuan, Juan Mauricio
Año de publicación
2005
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to use data structures like the Spatial Approximation Tree (SAT). This structure is a nice example of a tree structure in which well-known tricks for tree parallelization simply do not work. It is too sparse, unbalanced and its performance is too dependent on the work-load generated by the queries being solved by means of searching the tree. The complexity measure is given by the number of distances computed to retrieve those objects close enough to the query. In this paper we examine some alternatives to parallelize this structure through the MPI library and the BSPpub library.
Facultad de Informática
Materia
Ciencias Informáticas
multimedia searches
distances evaluations
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc/3.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/9608
Acceder
id SEDICI_a065c32932e3e98585a4588de2ae1543
oai_identifier_str oai:sedici.unlp.edu.ar:10915/9608
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A parallel search algorithm for the SATGil Costa, Graciela VerónicaPrintista, Alicia MarcelaReyes, Nora SusanaMarin Cahiuan, Juan MauricioCiencias Informáticasmultimedia searchesdistances evaluationsIn order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to use data structures like the Spatial Approximation Tree (SAT). This structure is a nice example of a tree structure in which well-known tricks for tree parallelization simply do not work. It is too sparse, unbalanced and its performance is too dependent on the work-load generated by the queries being solved by means of searching the tree. The complexity measure is given by the number of distances computed to retrieve those objects close enough to the query. In this paper we examine some alternatives to parallelize this structure through the MPI library and the BSPpub library.Facultad de Informática2005-12info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf299-304http://sedici.unlp.edu.ar/handle/10915/9608enginfo:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Dec05-21.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:44Zoai:sedici.unlp.edu.ar:10915/9608Institucionalhttp://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.093SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A parallel search algorithm for the SAT
title A parallel search algorithm for the SAT
spellingShingle A parallel search algorithm for the SAT
Gil Costa, Graciela Verónica
Ciencias Informáticas
multimedia searches
distances evaluations
title_short A parallel search algorithm for the SAT
title_full A parallel search algorithm for the SAT
title_fullStr A parallel search algorithm for the SAT
title_full_unstemmed A parallel search algorithm for the SAT
title_sort A parallel search algorithm for the SAT
dc.creator.none.fl_str_mv Gil Costa, Graciela Verónica
Printista, Alicia Marcela
Reyes, Nora Susana
Marin Cahiuan, Juan Mauricio
author Gil Costa, Graciela Verónica
author_facet Gil Costa, Graciela Verónica
Printista, Alicia Marcela
Reyes, Nora Susana
Marin Cahiuan, Juan Mauricio
author_role author
author2 Printista, Alicia Marcela
Reyes, Nora Susana
Marin Cahiuan, Juan Mauricio
author2_role author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
multimedia searches
distances evaluations
topic Ciencias Informáticas
multimedia searches
distances evaluations
dc.description.none.fl_txt_mv In order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to use data structures like the Spatial Approximation Tree (SAT). This structure is a nice example of a tree structure in which well-known tricks for tree parallelization simply do not work. It is too sparse, unbalanced and its performance is too dependent on the work-load generated by the queries being solved by means of searching the tree. The complexity measure is given by the number of distances computed to retrieve those objects close enough to the query. In this paper we examine some alternatives to parallelize this structure through the MPI library and the BSPpub library.
Facultad de Informática
description In order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to use data structures like the Spatial Approximation Tree (SAT). This structure is a nice example of a tree structure in which well-known tricks for tree parallelization simply do not work. It is too sparse, unbalanced and its performance is too dependent on the work-load generated by the queries being solved by means of searching the tree. The complexity measure is given by the number of distances computed to retrieve those objects close enough to the query. In this paper we examine some alternatives to parallelize this structure through the MPI library and the BSPpub library.
publishDate 2005
dc.date.none.fl_str_mv 2005-12
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/9608
url http://sedici.unlp.edu.ar/handle/10915/9608
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-Dec05-21.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
299-304
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_ 1844615758379745280
score 13.070432

Publicaciones similares