Synchronous and asynchronous approaches to model parallel programs are considered as two different schools. Intuition indicates that asynchronous programs should be more efficient since no periodical global time synchronization is required. However, in this paper we parallelize a resent index pivot-based technique for searching in metric spaces designed to improve bulk-massage-passing which reduce running times using a synchronous model. This model is designed to balance the load work en each machine between synchronizations and to reduce the number of synchronizations required to finish a batch of queries
Notas
Workshop de Procesamiento Distribuido y Paralelo (WPDP)
Información general
Fecha de exposición:octubre 2008
Fecha de publicación:2008
Idioma del documento:Inglés
Evento:XIV Congreso Argentino de Ciencias de la Computación
Institución de origen:Red de Universidades con Carreras en Informática (RedUNCI)
Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)