Bigger buffer k-d trees on multi-many-core systems

Research output: Chapter in Book/Report/Conference proceedingBook chapterResearchpeer-review

A buffer k -d tree is a k -d tree variant for massively-parallel nearest neighbor search. While providing valuable speed-ups on modern many-core devices in case both a large number of reference and query points are given, buffer k -d trees are limited by the amount of points that can fit on a single device. In this work, we show how to modify the original data structure and the associated workflow to make the overall approach capable of dealing with massive data sets. We further provide a simple yet efficient way of using multiple devices given in a single workstation. The applicability of the modified framework is demonstrated in the context of astronomy, a field that is faced with huge amounts of data.
Original languageEnglish
Title of host publicationHigh Performance Computing for Computational Science – VECPAR 2018 : 13th International Conference, São Pedro, Brazil, September 17–19, 2018, Revised Selected Papers
Publication date2019
ISBN (Print)978-3-030-15995-5
ISBN (Electronic)978-3-030-15996-2
Publication statusPublished - 2019
Event13th International Conference on High Performance Computing in Computational Science - São Pedro, Brazil
Duration: 17 Sep 201819 Sep 2018


Conference13th International Conference on High Performance Computing in Computational Science
BySão Pedro
SeriesLecture Notes in Computer Science


ID: 166494866