Skip to main content
SpringerLink
Log in

Radix Tree for Binary Sequences on GPU

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics (PPAM 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10777))

Abstract

In this paper, we present radix tree index structure (R-Trie) able to perform lookup over a set of keys of arbitrary length optimized for GPU processors. We present a fully parallel SIMD organized creation and search strategies. The R-Trie supports configurable bit stride for each level and nodes statistics for optimization purposes. We evaluate the performance using two search strategies and Longest Prefix Match (LPM) problem for computer networks. Unlike dedicated LPM algorithms we do not incorporate knowledge about the data or the network masks statistics into the tree construction or algorithm behavior. Our solution may be used in general purpose indexing structures where a batch search of massive number of keys is needed. (The research was funded by National Science Center, decision DEC-2012/07/D/ST6/02483.)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    github.com/mis-wut/lpm-tests.

  2. 2.

    Millions of Lookups per Second.

References

  1. Kaczmarski, K.: B+-tree optimized for GPGPU. In: Meersman, R., et al. (eds.) OTM 2012. LNCS, vol. 7566, pp. 843–854. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33615-7_27

    Chapter  Google Scholar 

  2. Li, Y., Zhang, D., Liu, A.X., Zheng, J.: GAMT: a fast and scalable IP lookup engine for GPU-based software routers. In: ANCS, pp. 1–12. IEEE Computer Society (2013)

    Google Scholar 

  3. Karras, T.: Maximizing parallelism in the construction of BVHs, octrees, and k-d trees. In: Dachsbacher, C., Munkberg, J., Pantaleoni, J. (eds.) High Performance Graphics, pp. 33–37. Eurographics Association, Aire-la-Ville (2012)

    Google Scholar 

  4. Lim, H., Lim, K., Lee, N., Park, K.-H.: On adding bloom filters to longest prefix matching algorithms. IEEE Trans. Comput. 63(2), 411–423 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  5. Lee, J., Lim, H.: Binary search on trie levels with a bloom filter for longest prefix match. In: HPSR, pp. 38–43. IEEE (2014)

    Google Scholar 

  6. Mu, S., Zhang, X., Zhang, N., Lu, J., Deng, Y.S., Zhang, S.: IP routing processing with graphic processors. In: Micheli, G.D., Al-Hashimi, B.M., Müller, W., Macii, E. (eds.) DATE, pp. 93–98. IEEE (2010)

    Google Scholar 

  7. Zheng, K., Liu, B.: V6Gene: a scalable IPv6 prefix generator for route lookup algorithm benchmark. In: AINA, vol. 1, pp. 147–152. IEEE Computer Society (2006)

    Google Scholar 

  8. Sahni, S., Kim, K.S.: Efficient construction of multibit tries for IP lookup. IEEE/ACM Trans. Netw. 11(4), 650–662 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Warsaw University of Technology, ul. Koszykowa 75, 00-662, Warszawa, Poland

    Krzysztof Kaczmarski & Albert Wolant

Authors
  1. Krzysztof Kaczmarski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Albert Wolant
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Krzysztof Kaczmarski .

Editor information

Editors and Affiliations

  1. Czestochowa University of Technology, Czestochowa, Poland

    Roman Wyrzykowski

  2. University of Tennessee, Knoxville, Tennessee, USA

    Jack Dongarra

  3. University of Southern California, Marina Del Rey, California, USA

    Ewa Deelman

  4. Czestochowa University of Technology, Czestochowa, Poland

    Konrad Karczewski

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kaczmarski, K., Wolant, A. (2018). Radix Tree for Binary Sequences on GPU. In: Wyrzykowski, R., Dongarra, J., Deelman, E., Karczewski, K. (eds) Parallel Processing and Applied Mathematics. PPAM 2017. Lecture Notes in Computer Science(), vol 10777. Springer, Cham. https://doi.org/10.1007/978-3-319-78024-5_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-78024-5_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-78023-8

  • Online ISBN: 978-3-319-78024-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation