GPU LSM: A Dynamic Dictionary Data Structure for the GPU

Saman Ashkiani, Shengren Li, Martin Farach-Colton, Nina Amenta, John D. Owens
University of California, Davis
arXiv:1707.05354 [cs.DC], (17 Jul 2017)


   title={GPU LSM: A Dynamic Dictionary Data Structure for the GPU},

   author={Ashkiani, Saman and Li, Shengren and Farach-Colton, Martin and Amenta, Nina and Owens, John D.},






Download Download (PDF)   View View   Source Source   



We develop and implement a concurrent dictionary data structure based on the Log Structured Merge tree (LSM), suitable for current massively parallel GPU architectures. Our GPU LSM is dynamic (mutable) in that it provides fast updates (insertions and deletions). For example, on an NVIDIA K40c GPU we can get an average update rate of 225 M elements/s (13.5x faster than merging with a sorted array). GPU LSM also supports lookup, count, and range query operations with an average rate of 75 M, 32 M and 23 M queries/s respectively. For lookups, we are 7.5x (and 1.75x) slower than a hash table (and a sorted array). However, none of these other data structures are considered mutable, and hash tables cannot even support count and range queries. We believe that our GPU LSM is the first dynamic general-purpose GPU data structure.
Rating: 1.8/5. From 2 votes.
Please wait...

* * *

* * *

HGPU group © 2010-2021 hgpu.org

All rights belong to the respective authors

Contact us: