Andrey Prokopenko

Andrey Prokopenko

Auto-generated profile, based on publicly available information

Andrey Prokopenko

Oak Ridge National Laboratory, Oak Ridge, Tennessee, USA

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 December 2014 in Parallel Processing Letters
Verified
Journal Article
Closed access
PLPaul Lin
Paul Lin
MBMatthew Bettencourt
Matthew Bettencourt
SDStefan Domino
Stefan Domino
TFTravis Fisher
Travis Fisher
MHMark Hoemmen
Mark Hoemmen
SKStephen Kennon
Stephen Kennon

8 December 2020 in ACM Transactions on Mathematical Software
Verified
Journal Article
Open access
DLD. Lebrun-Grandié
D. Lebrun-Grandié
APA. Prokopenko
A. Prokopenko
BTB. Turcksin
B. Turcksin
SSS. R. Slattery
S. R. Slattery
Searching for geometric objects that are close in space is a fundamental component of many applications. The performance of search algorithms comes to the forefront as the size of a problem increases both in terms of total object count as well as in the total number of search queries performed. Scientific applications requiring modern leadership-class supercomputers also pose an additional requirement of performance portability, i.e., being able to efficiently utilize a variety of hardware architectures. In this article, we introduce a new open-source C++ search library, ArborX, which we have designed for modern supercomputing architectures. We examine scalable search algorithms with a focus on performance, including a highly efficient parallel bounding volume hierarchy implementation, and propose a flexible interface making it easy to integrate with existing applications. We demonstrate the performance portability of ArborX on multi-core CPUs and GPUs and compare it to the state-of-the-art libraries such as Boost.Geometry.Index and nanoflann.

12 November 2023
Verified
Conference Paper
Open access
CSChristopher M Siefert
Christopher M Siefert
CPCarl Pearson
Carl Pearson
SOStephen L. Olivier
Stephen L. Olivier
APAndrey Prokopenko
Andrey Prokopenko
JHJonathan Hu
Jonathan Hu
TFTimothy J. Fuller
Timothy J. Fuller
As a rule, Top 500 class supercomputers are extensively benchmarked as part of their acceptance testing process. However, barring publicly posted LINPACK / HPCG results, most benchmark results are often inaccessible outside the hosting institution. Moreover, these higher level benchmarks do not provide easy answers to common questions such as “What is the realizable memory bandwidth?” or “What is the launch latency on the accelerator?” To partially address these issues, we executed selected single-node micro-benchmarks — focused on latencies and memory bandwidth — on every US Department of Energy system above rank 150 of the June 2023 Top 500 list, excepting NERSC’s Cori and ORNL’s Frontier TDS (now decommissioned or repurposed). We hope to provide an easy “first stop” reference for users of current Top 500 systems and inspire users and administrators of other Top 500 systems to similarly compile and make available benchmark results for their systems.

7 August 2023
Verified
Conference Paper
Open access
APAndrey Prokopenko
Andrey Prokopenko
DLDamien Lebrun-Grandie
Damien Lebrun-Grandie
DADaniel Arndt
Daniel Arndt
DBSCAN is a well-known density-based clustering algorithm to discover arbitrary shape clusters. While conceptually simple in serial, the algorithm is challenging to efficiently parallelize on manycore GPU architectures. Common pitfalls, such as asynchronous range query calls, result in high thread execution divergence in many implementations. In this paper, we propose a new framework for GPU-accelerated DBSCAN, and describe two tree-based algorithms within that framework. Both algorithms fuse the search for neighbors with updating cluster information, but differ in their treatment of dense regions of the data. We show that the time taken to compute clusters is at most twice that of determination of the neighbors. We compare the proposed algorithms with existing CPU and GPU implementations, and demonstrate their competitiveness and performance using a fast traversal structure (bounding volume hierarchy) for low dimensional data. We also show that the memory usage can be reduced by processing object neighbors dynamically without storing them.

12 August 2024
Verified
Conference Paper
Open access
PSPiyush Sao
Piyush Sao
APAndrey Prokopenko
Andrey Prokopenko
DLDamien Lebrun-Grandie
Damien Lebrun-Grandie
This paper introduces Pandora, a parallel algorithm for computing dendrograms, the hierarchical cluster trees for single linkage clustering (SLC). Current parallel approaches construct dendrograms by partitioning a minimum spanning tree and removing edges. However, they struggle with skewed, hard-to-parallelize real-world dendrograms. Consequently, computing dendrograms is the sequential bottleneck in HDBSCAN*[21], a popular SLC variant. Pandora uses recursive tree contraction to address this limitation. Pandora contracts nodes to construct progressively smaller trees. It computes the smallest contracted dendrogram and expands it by inserting contracted edges. This recursive strategy is highly parallel, skew-independent, work-optimal, and well-suited for GPUs and multicores. We develop a performance portable implementation of Pandora in Kokkos[31] and evaluate its performance on multicore CPUs and multi-vendor GPUs (e.g., Nvidia, AMD) for dendrogram construction in HDBSCAN*. Multithreaded Pandora is 2.2x faster than the current best-multithreaded implementation. Our GPU version achieves 6-20x speedup on AMD GPUs and 10-37x on NVIDIA GPUs over multithreaded Pandora. Pandora removes HDBSCAN*’s sequential bottleneck, greatly boosting efficiency, particularly with GPUs.

19 June 2017 in Numerical Linear Algebra with Applications
Verified
Journal Article
Closed access
PDF file
APAndrey Prokopenko
Andrey Prokopenko
RTRaymond S. Tuminaro
Raymond S. Tuminaro