Standard
Bigger buffer k-d trees on multi-many-core systems. / Gieseke, Fabian Cristian; Oancea, Cosmin Eugen; Mahabal, Ashish; Igel, Christian; Heskes, Tom.
High Performance Computing for Computational Science – VECPAR 2018: 13th International Conference, São Pedro, Brazil, September 17–19, 2018, Revised Selected Papers. Springer, 2019. s. 202-214 (Lecture Notes in Computer Science, Bind 11333).
Publikation: Bidrag til bog/antologi/rapport › Bidrag til bog/antologi › Forskning › fagfællebedømt
Harvard
Gieseke, FC, Oancea, CE, Mahabal, A
, Igel, C & Heskes, T 2019,
Bigger buffer k-d trees on multi-many-core systems. i
High Performance Computing for Computational Science – VECPAR 2018: 13th International Conference, São Pedro, Brazil, September 17–19, 2018, Revised Selected Papers. Springer, Lecture Notes in Computer Science, bind 11333, s. 202-214, 13th International Conference on High Performance Computing in Computational Science, São Pedro, Brasilien,
17/09/2018.
https://doi.org/10.1007/978-3-030-15996-2_15
APA
Gieseke, F. C., Oancea, C. E., Mahabal, A.
, Igel, C., & Heskes, T. (2019).
Bigger buffer k-d trees on multi-many-core systems. I
High Performance Computing for Computational Science – VECPAR 2018: 13th International Conference, São Pedro, Brazil, September 17–19, 2018, Revised Selected Papers (s. 202-214). Springer. Lecture Notes in Computer Science Bind 11333
https://doi.org/10.1007/978-3-030-15996-2_15
Vancouver
Gieseke FC, Oancea CE, Mahabal A
, Igel C, Heskes T.
Bigger buffer k-d trees on multi-many-core systems. I High Performance Computing for Computational Science – VECPAR 2018: 13th International Conference, São Pedro, Brazil, September 17–19, 2018, Revised Selected Papers. Springer. 2019. s. 202-214. (Lecture Notes in Computer Science, Bind 11333).
https://doi.org/10.1007/978-3-030-15996-2_15
Author
Gieseke, Fabian Cristian ; Oancea, Cosmin Eugen ; Mahabal, Ashish ; Igel, Christian ; Heskes, Tom. / Bigger buffer k-d trees on multi-many-core systems. High Performance Computing for Computational Science – VECPAR 2018: 13th International Conference, São Pedro, Brazil, September 17–19, 2018, Revised Selected Papers. Springer, 2019. s. 202-214 (Lecture Notes in Computer Science, Bind 11333).
Bibtex
@inbook{711f12d21bf241cc93cbe7d19f1110ed,
title = "Bigger buffer k-d trees on multi-many-core systems",
abstract = "A buffer k -d{\^A} tree is a k -d{\^A} 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{\^A} 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.",
author = "Gieseke, {Fabian Cristian} and Oancea, {Cosmin Eugen} and Ashish Mahabal and Christian Igel and Tom Heskes",
year = "2019",
doi = "10.1007/978-3-030-15996-2_15",
language = "English",
isbn = "978-3-030-15995-5",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "202--214",
booktitle = "High Performance Computing for Computational Science – VECPAR 2018",
address = "Switzerland",
note = "13th International Conference on High Performance Computing in Computational Science, VECPAR 2018 ; Conference date: 17-09-2018 Through 19-09-2018",
}
RIS
TY - CHAP
T1 - Bigger buffer k-d trees on multi-many-core systems
AU - Gieseke, Fabian Cristian
AU - Oancea, Cosmin Eugen
AU - Mahabal, Ashish
AU - Igel, Christian
AU - Heskes, Tom
PY - 2019
Y1 - 2019
N2 - 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.
AB - 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.
U2 - 10.1007/978-3-030-15996-2_15
DO - 10.1007/978-3-030-15996-2_15
M3 - Book chapter
SN - 978-3-030-15995-5
T3 - Lecture Notes in Computer Science
SP - 202
EP - 214
BT - High Performance Computing for Computational Science – VECPAR 2018
PB - Springer
T2 - 13th International Conference on High Performance Computing in Computational Science
Y2 - 17 September 2018 through 19 September 2018
ER -
