A parallel search algorithm for the SAT

Authors
Gil Costa, Graciela Verónica; Printista, Alicia Marcela; Reyes, Nora Susana; Marín, Mauricio
Publication Year
2005
Language
English
Format
conference paper
Status
Published version
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
VI Workshop de Procesamiento Distribuido y Paralelo (WPDP)
Red de Universidades con Carreras en Informática (RedUNCI)
Subject
Ciencias Informáticas
Search process
Parallel algorithms
SAT
metric spaces
MPI
BSP
Access level
Open access
License
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
Repository
SEDICI (UNLP)
Institution
Universidad Nacional de La Plata
OAI Identifier
oai:sedici.unlp.edu.ar:10915/23169