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 strucures 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 spars...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Gil Costa, Graciela Verónica, Printista, Alicia Marcela, Reyes, Nora Susana, Marín, Mauricio
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2005
Materias:
Ciencias Informáticas
SAT
metric spaces
MPI
BSP
Search process
Parallel algorithms
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23169
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-23169
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
SAT
metric spaces
MPI
BSP
Search process
Parallel algorithms
spellingShingle Ciencias Informáticas
SAT
metric spaces
MPI
BSP
Search process
Parallel algorithms
Gil Costa, Graciela Verónica
Printista, Alicia Marcela
Reyes, Nora Susana
Marín, Mauricio
A parallel search algorithm for the SAT
topic_facet Ciencias Informáticas
SAT
metric spaces
MPI
BSP
Search process
Parallel algorithms
description In order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to use data strucures 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 Objeto de conferencia
Objeto de conferencia
author Gil Costa, Graciela Verónica
Printista, Alicia Marcela
Reyes, Nora Susana
Marín, Mauricio
author_facet Gil Costa, Graciela Verónica
Printista, Alicia Marcela
Reyes, Nora Susana
Marín, 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/23169
work_keys_str_mv AT gilcostagracielaveronica aparallelsearchalgorithmforthesat
AT printistaaliciamarcela aparallelsearchalgorithmforthesat
AT reyesnorasusana aparallelsearchalgorithmforthesat
AT marinmauricio aparallelsearchalgorithmforthesat
AT gilcostagracielaveronica parallelsearchalgorithmforthesat
AT printistaaliciamarcela parallelsearchalgorithmforthesat
AT reyesnorasusana parallelsearchalgorithmforthesat
AT marinmauricio parallelsearchalgorithmforthesat
bdutipo_str Repositorios
_version_ 1764820465729142785

Ejemplares similares