Skip to main content
Top
Published in: Cluster Computing 1/2016

01-03-2016

Similarity (range and kNN) queries processing on an Intel Xeon Phi coprocessor

Authors: Carlos M. Toledo, Ricardo J. Barrientos, Andrés I. Ávila

Published in: Cluster Computing | Issue 1/2016

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Nowadays, the evolution of information technologies requires fast similarity search tools for analyzing new data types as audio, video, or images. The usual search by keys or records is not possible and to search on these databases is a compute-intensive problem. Regarding this, in the latest years, compute-intensive coprocessors (mainly NVIDIA GPUs) have been studied as a tool for accelerating sequential processing algorithms. In this work, we implement kNN and range queries on the recently launched Intel Xeon Phi coprocessor. We developed exhaustive and also indexing algorithms using the LC index. This index has been widely studied in sequential computing to accelerate similarity search on multimedia databases. We implement and compare different exhaustive and indexing versions showing some key factors in Xeon Phi to deal with this type of search. For indexing algorithms, we used a strategy based on cluster distribution among cores LC MIC Dist-C obtaining up to 168\(\times \) over the sequential exhaustive algorithm. Our algorithms using exhaustive strategies in Xeon Phi for range queries achieve up to 22\(\times \) speed-up over the sequential counterpart compared to the 12\(\times \) of a 20-core machine, and a similar advantage is achieved for kNN queries. Comparing with GPUs, we obtain higher performance on our indexing algorithms on Intel Xeon Phi. However, GPU works faster with memory-aligned access exhaustive algorithms. Our exhaustive approaches on Xeon Phi can be used on a wide class of databases, for example, non-metric spaces. Finally, we extend our algorithms to be used with large databases that do not fit in the coprocessor memory, showing a good scalability with the number of elements.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
1
This programmer control is larger when using the SRAM mainly as a software controlled memory, but hardware controlled cache must also be taken into account during the mapping.
 
Literature
4.
go back to reference PRACE (Partnership for Advanced Computing in Europe). Best Practice Guide - Intel Xeon Phi PRACE (Partnership for Advanced Computing in Europe). Best Practice Guide - Intel Xeon Phi
6.
go back to reference Barrena, M., Jurado, E., Márquez-Neila, P., Pachón, C.: A flexible framework to ease nearest neighbor search in multidimensional data spaces. Data Knowl. Eng. 69(1), 116–136 (2010)CrossRef Barrena, M., Jurado, E., Márquez-Neila, P., Pachón, C.: A flexible framework to ease nearest neighbor search in multidimensional data spaces. Data Knowl. Eng. 69(1), 116–136 (2010)CrossRef
7.
go back to reference Barrientos, R., Gómez, J., Tenllado, C., Prieto, M., Marin, M.: knn query processing in metric spaces using gpus. In: 17th International European Conference on Parallel and Distributed Computing (Euro-Par 2011), pp. 380–392 (2011) Barrientos, R., Gómez, J., Tenllado, C., Prieto, M., Marin, M.: knn query processing in metric spaces using gpus. In: 17th International European Conference on Parallel and Distributed Computing (Euro-Par 2011), pp. 380–392 (2011)
8.
go back to reference Barrientos, R., Gómez, J., Tenllado, C., Prieto, M., Zezula, P.: Multi-level clustering on metric spaces using a multi-gpu platform. In: 19th International European Conference on Parallel and Distributed Computing (Euro-Par 2013), LNCS, vol. 8097, pp. 216–228. Springer, Aachen (2013). doi:10.1007/978-3-642-40047-6_24 Barrientos, R., Gómez, J., Tenllado, C., Prieto, M., Zezula, P.: Multi-level clustering on metric spaces using a multi-gpu platform. In: 19th International European Conference on Parallel and Distributed Computing (Euro-Par 2013), LNCS, vol. 8097, pp. 216–228. Springer, Aachen (2013). doi:10.​1007/​978-3-642-40047-6_​24
11.
go back to reference Brisaboa, N.R., Pedreira, O., Seco, D., Solar, R., Uribe, R.: Clustering-based similarity search in metric spaces with sparse spatial centers. In: SOFSEM, pp. 186–197 (2008) Brisaboa, N.R., Pedreira, O., Seco, D., Solar, R., Uribe, R.: Clustering-based similarity search in metric spaces with sparse spatial centers. In: SOFSEM, pp. 186–197 (2008)
12.
go back to reference Cappelli, R., Ferrara, M., Maltoni, D.: Large-scale fingerprint identification on gpu. Inf. Sci. 306, 1–20 (2015)CrossRef Cappelli, R., Ferrara, M., Maltoni, D.: Large-scale fingerprint identification on gpu. Inf. Sci. 306, 1–20 (2015)CrossRef
13.
go back to reference Chávez, E., Graff, M., Navarro, G., Téllez, E.: Near neighbor searching with k nearest references. Inf. Syst. 51, 43–61 (2015)CrossRef Chávez, E., Graff, M., Navarro, G., Téllez, E.: Near neighbor searching with k nearest references. Inf. Syst. 51, 43–61 (2015)CrossRef
14.
go back to reference Chávez, E., Navarro, G.: A compact space decomposition for effective metric indexing. Pattern Recognit. Lett. 26(9), 1363–1376 (2005)CrossRef Chávez, E., Navarro, G.: A compact space decomposition for effective metric indexing. Pattern Recognit. Lett. 26(9), 1363–1376 (2005)CrossRef
15.
go back to reference Chávez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273–321 (2001)CrossRef Chávez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273–321 (2001)CrossRef
16.
go back to reference Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: VLDB’97, Proceedings of 23rd International Conference on Very Large Data Bases, 25–29 Aug, 1997, Athens, Greece, pp. 426–435. Morgan Kaufmann (1997) Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: VLDB’97, Proceedings of 23rd International Conference on Very Large Data Bases, 25–29 Aug, 1997, Athens, Greece, pp. 426–435. Morgan Kaufmann (1997)
17.
go back to reference Dolz, M., Igual, F., Ludwig, T., Piñuel, L., Quintana-Ortí, E.: Balancing task-and data-level parallelism to improve performance and energy consumption of matrix computations on the intel xeon phi. To appear in Comput. Electr. Eng. (2015) Dolz, M., Igual, F., Ludwig, T., Piñuel, L., Quintana-Ortí, E.: Balancing task-and data-level parallelism to improve performance and energy consumption of matrix computations on the intel xeon phi. To appear in Comput. Electr. Eng. (2015)
18.
go back to reference Foley, T., Sugerman, J.: Kd-tree acceleration structures for a GPU raytracer. In: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Symposium on Graphics Hardware 2005, pp. 15–22. Eurographics Association (2005). doi:10.1145/1071866.1071869 Foley, T., Sugerman, J.: Kd-tree acceleration structures for a GPU raytracer. In: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Symposium on Graphics Hardware 2005, pp. 15–22. Eurographics Association (2005). doi:10.​1145/​1071866.​1071869
20.
go back to reference Gao, Y., Zheng, B., Chen, G., Li, Q.: On efficient mutual nearest neighbor query processing in spatial databases. Data Knowl. Eng. 68(8), 705–727 (2009)CrossRef Gao, Y., Zheng, B., Chen, G., Li, Q.: On efficient mutual nearest neighbor query processing in spatial databases. Data Knowl. Eng. 68(8), 705–727 (2009)CrossRef
21.
go back to reference Gil-Costa, V., Barrientos, R.J., Marin, M., Bonacic, C.: Scheduling metric-space queries processing on multi-core processors. In: 18th Euromicro Conference on Parallel. Distributed and Network-based Processing (PDP 2010), pp. 187–194. IEEE Computer Society, Pisa (2010) Gil-Costa, V., Barrientos, R.J., Marin, M., Bonacic, C.: Scheduling metric-space queries processing on multi-core processors. In: 18th Euromicro Conference on Parallel. Distributed and Network-based Processing (PDP 2010), pp. 187–194. IEEE Computer Society, Pisa (2010)
22.
go back to reference Gowanlock, M., Casanova, H.: Indexing of spatiotemporal trajectories for efficient distance threshold similarity searches on the GPU. In: 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, pp. 387–396. IEEE Computer Society, Hyderabad (2015). doi:10.1109/IPDPS.2015.24 Gowanlock, M., Casanova, H.: Indexing of spatiotemporal trajectories for efficient distance threshold similarity searches on the GPU. In: 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, pp. 387–396. IEEE Computer Society, Hyderabad (2015). doi:10.​1109/​IPDPS.​2015.​24
23.
go back to reference Hwu, W.: Programming Massively Parallel Processors, Second Edition: A Hands-on Approach. Morgan Kaufmann, Burlington (2012) Hwu, W.: Programming Massively Parallel Processors, Second Edition: A Hands-on Approach. Morgan Kaufmann, Burlington (2012)
28.
go back to reference Novak, D., Batko, M., Zezula, P.: Metric index: an efficient and scalable solution for precise and approximate similarity search. Inf. Syst. 36(4), 721–733 (2011)CrossRef Novak, D., Batko, M., Zezula, P.: Metric index: an efficient and scalable solution for precise and approximate similarity search. Inf. Syst. 36(4), 721–733 (2011)CrossRef
29.
30.
go back to reference NVIDIA: Nvidia’s next generation cuda compute architecture: Fermi. Technical Report (2010) NVIDIA: Nvidia’s next generation cuda compute architecture: Fermi. Technical Report (2010)
32.
go back to reference Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann Publishers Inc., San Francisco (2005)MATH Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann Publishers Inc., San Francisco (2005)MATH
36.
go back to reference Wang, E., Zhang, Q., Shen, B., Zhang, G., Lu, X., Wu, Q., Wang, Y.: High-Performance Computing on the Intel Xeon Phi(TM): How to Fully Exploit MIC Architectures. Springer, New York (2014) Wang, E., Zhang, Q., Shen, B., Zhang, G., Lu, X., Wu, Q., Wang, Y.: High-Performance Computing on the Intel Xeon Phi(TM): How to Fully Exploit MIC Architectures. Springer, New York (2014)
37.
go back to reference Wilt, N.: The CUDA Handbook: A Comprehensive Guide to GPU Programming. Addison-Wesley Professional, Boston (2013) Wilt, N.: The CUDA Handbook: A Comprehensive Guide to GPU Programming. Addison-Wesley Professional, Boston (2013)
38.
go back to reference Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach, Advances in Database Systems, vol. 32. Springer, New York (2006)MATH Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach, Advances in Database Systems, vol. 32. Springer, New York (2006)MATH
Metadata
Title
Similarity (range and kNN) queries processing on an Intel Xeon Phi coprocessor
Authors
Carlos M. Toledo
Ricardo J. Barrientos
Andrés I. Ávila
Publication date
01-03-2016
Publisher
Springer US
Published in
Cluster Computing / Issue 1/2016
Print ISSN: 1386-7857
Electronic ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-015-0515-z

Other articles of this Issue 1/2016

Cluster Computing 1/2016 Go to the issue

Premium Partner