Paper
29 May 2013 Performance impact of dynamic parallelism on different clustering algorithms
Author Affiliations +
Abstract
In this paper, we aim to quantify the performance gains of dynamic parallelism. The newest version of CUDA, CUDA 5, introduces dynamic parallelism, which allows GPU threads to create new threads, without CPU intervention, and adapt to its data. This effectively eliminates the superfluous back and forth communication between the GPU and CPU through nested kernel computations. The change in performance will be measured using two well-known clustering algorithms that exhibit data dependencies: the K-means clustering and the hierarchical clustering. K-means has a sequential data dependence wherein iterations occur in a linear fashion, while the hierarchical clustering has a tree-like dependence that produces split tasks. Analyzing the performance of these data-dependent algorithms gives us a better understanding of the benefits or potential drawbacks of CUDA 5’s new dynamic parallelism feature.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jeffrey DiMarco and Michela Taufer "Performance impact of dynamic parallelism on different clustering algorithms", Proc. SPIE 8752, Modeling and Simulation for Defense Systems and Applications VIII, 87520E (29 May 2013); https://doi.org/10.1117/12.2018069
Lens.org Logo
CITATIONS
Cited by 25 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Chemical elements

Computer programming

Algorithm development

Statistical analysis

Data mining

Data modeling

Platinum

Back to Top