A parallel search algorithm for the SAT

Mostrar todas las versiones(2)

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 spar...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Gil Costa, Graciela Verónica, Printista, Alicia Marcela, Reyes, Nora Susana, Marin Cahiuan, Juan Mauricio
Formato: Articulo
Lenguaje:Inglés
Publicado: 2005
Materias:
Ciencias Informáticas
multimedia searches
distances evaluations
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/9608
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Dec05-21.pdf
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-9608
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
multimedia searches
distances evaluations
spellingShingle Ciencias Informáticas
multimedia searches
distances evaluations
Gil Costa, Graciela Verónica
Printista, Alicia Marcela
Reyes, Nora Susana
Marin Cahiuan, Juan Mauricio
A parallel search algorithm for the SAT
topic_facet Ciencias Informáticas
multimedia searches
distances evaluations
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.
format Articulo
Articulo
author Gil Costa, Graciela Verónica
Printista, Alicia Marcela
Reyes, Nora Susana
Marin Cahiuan, Juan Mauricio
author_facet Gil Costa, Graciela Verónica
Printista, Alicia Marcela
Reyes, Nora Susana
Marin Cahiuan, Juan Mauricio
author_sort Gil Costa, Graciela Verónica
title A parallel search algorithm for the SAT
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 parallel search algorithm for the sat
publishDate 2005
url http://sedici.unlp.edu.ar/handle/10915/9608
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Dec05-21.pdf
work_keys_str_mv AT gilcostagracielaveronica aparallelsearchalgorithmforthesat
AT printistaaliciamarcela aparallelsearchalgorithmforthesat
AT reyesnorasusana aparallelsearchalgorithmforthesat
AT marincahiuanjuanmauricio aparallelsearchalgorithmforthesat
AT gilcostagracielaveronica parallelsearchalgorithmforthesat
AT printistaaliciamarcela parallelsearchalgorithmforthesat
AT reyesnorasusana parallelsearchalgorithmforthesat
AT marincahiuanjuanmauricio parallelsearchalgorithmforthesat
bdutipo_str Repositorios
_version_ 1764820491730681856

Ejemplares similares