PPoPP 2019
Sat 16 - Wed 20 February 2019 Washington, DC, United States
Mon 18 Feb 2019 16:35 - 17:00 at Salon 12/13 - Session 4: GPU B-Trees Chair(s): Ang Li

We engineer a GPU implementation of a B-Tree that supports concurrent queries (point, range, and successor) and updates (insertions and deletions). Our B-tree outperforms the state of the art, a GPU log-structured merge tree (LSM) and a GPU sorted array. In particular, point and range queries are significantly faster than in a GPU LSM (the GPU LSM does not implement successor queries). Furthermore, B-Tree insertions are also faster than LSM and sorted array insertions unless insertions come in batches of more than roughly 100k. Because we cache the upper levels of the tree, we achieve lookup throughput that exceeds the DRAM bandwidth of the GPU. We demonstrate that the key limiter of performance on a GPU is contention and describe the design choices that allow us to achieve this high performance.

Mon 18 Feb
Times are displayed in time zone: (GMT-05:00) Guadalajara, Mexico City, Monterrey change

16:10 - 17:00: Main Conference - Session 4: GPU B-Trees at Salon 12/13
Chair(s): Ang LiPacific Northwest National Laboratory
PPoPP-2019-papers16:10 - 16:35
Zhaofeng YanFudan University, Yuzhe LinFudan University, Lu Peng, Weihua ZhangFudan University
PPoPP-2019-papers16:35 - 17:00
Muhammad Awad, Saman AshkianiUniversity of California, Davis, Rob JohnsonVMWare Research, Martin Farach-ColtonRutgers University, John D. OwensUniversity of California, Davis