Similarity search implementations for multi-core and many-core processors
Similarity search implementations for multi-core and many-core processors
复制标题
DOI：
10.1109/hpcsim.2011.5999889
复制
发表时间：
2011-07
期刊：
影响因子：
--
通讯作者：
Roberto Uribe;Pedro Valero-Lara;E. Arias;J. L. Sánchez;D. Cazorla
中科院分区：
文献类型：
--
作者：
Roberto Uribe;Pedro Valero-Lara;E. Arias;J. L. Sánchez;D. Cazorla
度量数据库中大量存储对象的相似性搜索已成为一个非常有趣的问题。Spaghettis是一种有效的度量数据结构，用于索引度量空间。然而，对于真实的应用程序，当处理大量数据时，查询响应时间可能足够长。在这种情况下，有必要应用一些机制来显著减少平均查询响应时间。从这个意义上说，度量结构处理的并行化是一个有趣的研究领域。现代多核和众核系统提供了非常令人印象深刻的成本/性能比。在本文中，两个新的并行实现范围查询的Spaghettis数据结构进行了：其中一个在众核处理器上，另一个在多核处理器上。这两种实现已经在执行时间和加速方面进行了比较。
Similarity search in a large collection of stored objects in a metric database has become a most interesting problem. The Spaghettis is an efficient metric data structure to index metric spaces. However, for real applications, when processing large volumes of data, query response time can be high enough. In this case, it is necessary to apply mechanisms in order to significantly reduce the average query response time. In this sense, the parallelization of the metric structures processing is an interesting field of research. Modern multi-core and many-core systems offer a very impressive cost/performance ratio. In this paper two new parallel implementations for range queries on Spaghettis data structures have been carried out: one of them on a many-core processor and the other one on a multi-core processor. Both implementations have been compared in terms of execution time and speedup.