A parallel search algorithm for the SAT

• Autores: Graciela Verónica Gil Costa, Alicia Marcela Printista, Nora Susana Reyes, Mauricio Marin Caihuan
• Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 5, Nº. 4, 2005 (Ejemplar dedicado a: Sixteenth Issue), págs. 299-304
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

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