Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
43 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fast tree-based algorithms for DBSCAN for low-dimensional data on GPUs (2103.05162v2)

Published 9 Mar 2021 in cs.DC

Abstract: 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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (43)
  1. (2018). Next generation simulation (NGSIM) vehicle trajectories and supporting data. Available online: https://catalog.data.gov/dataset/next-generation-simulation-ngsim-vehicle-trajectories-and-supporting-data. Accessed: 2021-03-06.
  2. G-DBSCAN: A GPU Accelerated Algorithm for Density-based Clustering. Procedia Computer Science, 18:369–378.
  3. Experiments in Parallel Clustering with DBSCAN. In Sakellariou, R., Gurd, J., Freeman, L., and Keane, J., editors, Euro-Par 2001 Parallel Processing, pages 326–331, Berlin, Heidelberg. Springer.
  4. Bentley, J. L. (1975). Multidimensional Binary Search Trees Used for Associative Searching. Communication of the ACM, 18(9):509–517.
  5. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys, 33(3):322–373.
  6. Density-based clustering using graphics processors. In Proceedings of the 18th ACM conference on Information and knowledge management, CIKM ’09, pages 661–670, Hong Kong, China. Association for Computing Machinery.
  7. Density-Based Clustering Based on Hierarchical Density Estimates. In Pei, J., Tseng, V. S., Cao, L., Motoda, H., and Xu, G., editors, Advances in Knowledge Discovery and Data Mining, Lecture Notes in Computer Science, pages 160–172, Berlin, Heidelberg. Springer.
  8. KNN-BLOCK DBSCAN: Fast Clustering for Large-Scale Data. IEEE Transactions on Systems, Man, and Cybernetics: Systems, pages 1–15.
  9. Efficient Map/Reduce-Based DBSCAN Algorithm with Optimized Data Partition. In 2012 IEEE Fifth International Conference on Cloud Computing, pages 59–66.
  10. UCI machine learning repository.
  11. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, KDD’96, pages 226–231. AAAI Press.
  12. On the Hardness and Approximation of Euclidean DBSCAN. ACM Transactions on Database Systems, 42(3):14:1–14:45.
  13. Gowanlock, M. (2019). Hybrid CPU/GPU clustering in shared memory on the billion point scale. In Proceedings of the ACM International Conference on Supercomputing, ICS ’19, pages 35–45, Phoenix, Arizona. Association for Computing Machinery.
  14. Clustering Throughput Optimization on the GPU. In 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pages 832–841.
  15. A Hybrid Approach for Optimizing Parallel Clustering Throughput using the GPU. IEEE Transactions on Parallel and Distributed Systems, 30(4):766–777.
  16. Guttman, A. (1984). R-trees: A Dynamic Index Structure for Spatial Searching. In Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, SIGMOD ’84, pages 47–57, New York, NY, USA. ACM.
  17. HPDBSCAN: highly parallel DBSCAN. In Proceedings of the Workshop on Machine Learning in High-Performance Computing Environments, MLHPC ’15, pages 1–10, Austin, Texas. Association for Computing Machinery.
  18. HACC: Simulating sky surveys on state-of-the-art supercomputing architectures. New Astronomy, 42:49–65.
  19. MR-DBSCAN: An Efficient Parallel Density-Based Clustering Algorithm Using MapReduce. In 2011 IEEE 17th International Conference on Parallel and Distributed Systems, pages 473–480.
  20. A Communication Efficient Parallel DBSCAN Algorithm based on Parameter Server. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, CIKM ’17, pages 2107–2110, Singapore, Singapore. Association for Computing Machinery.
  21. A High-performance Connected Components Implementation for GPUs. In Proceedings of the 27th International Symposium on High-Performance Parallel and Distributed Computing, HPDC ’18, pages 92–104, New York, NY, USA. ACM.
  22. Karras, T. (2012). Maximizing Parallelism in the Construction of BVHs, Octrees, and K-d Trees. In Proceedings of the Fourth ACM SIGGRAPH / Eurographics Conference on High-Performance Graphics, EGGH-HPG’12, pages 33–37, Goslar Germany, Germany. Eurographics Association.
  23. Exact, Fast and Scalable Parallel DBSCAN for Commodity Platforms. In Proceedings of the 18th International Conference on Distributed Computing and Networking, ICDCN ’17, pages 1–10, Hyderabad, India. Association for Computing Machinery.
  24. ArborX: A Performance Portable Geometric Search Library. ACM Transactions on Mathematical Software, 47(1):2:1–2:15.
  25. Fast density-based clustering through dataset partition using graphics processing units. Information Sciences, 308:94–112.
  26. NG-DBSCAN: scalable density-based clustering for arbitrary data. Proceedings of the VLDB Endowment, 10(3):157–168.
  27. A Survey on Bounding Volume Hierarchies for Ray Tracing. Computer Graphics Forum, 40(2):683–712.
  28. Predicting taxi–passenger demand using streaming data. IEEE Transactions on Intelligent Transportation Systems, 14(3):1393–1402.
  29. An Experimental Comparison of GPU Techniques for DBSCAN Clustering. In 2019 IEEE International Conference on Big Data (Big Data), pages 3701–3710.
  30. RT-DBSCAN: Accelerating DBSCAN using Ray Tracing Hardware.
  31. BD-CATS: big data clustering at trillion particle scale. In SC ’15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pages 1–12.
  32. A new scalable parallel DBSCAN algorithm using the disjoint-set data structure. In SC ’12: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, pages 1–11.
  33. Pardicle: Parallel Approximate Density-Based Clustering. In SC ’14: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pages 560–571.
  34. CUDA-DClust+: Revisiting Early GPU-Accelerated DBSCAN Clustering Designs. In 2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC), pages 354–363.
  35. Utilizing many-core accelerators for halo and center finding within a cosmology simulation. In 2015 IEEE 5th Symposium on Large Data Analysis and Visualization (LDAV), pages 91–98.
  36. RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning. In Proceedings of the 2018 International Conference on Management of Data, SIGMOD ’18, pages 1173–1187, Houston, TX, USA. Association for Computing Machinery.
  37. Tarjan, R. E. (1979). A class of algorithms which require nonlinear time to maintain disjoint sets. Journal of Computer and System Sciences, 18(2):110–127.
  38. Memory-efficient implementation of a graphics processor-based cluster detection algorithm for large spatial databases. In 2010 IEEE International Conference on Electro/Information Technology, pages 1–5.
  39. Kokkos 3: programming model extensions for the exascale era. IEEE Transactions on Parallel and Distributed Systems, 33(4):805–817. Conference Name: IEEE Transactions on Parallel and Distributed Systems.
  40. Theoretically-Efficient and Practical Parallel DBSCAN. In Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, SIGMOD ’20, pages 2555–2571, Portland, OR, USA. Association for Computing Machinery.
  41. The Anatomy of Mr. Scan: A Dissection of Performance of an Extreme Scale GPU-Based Clustering Algorithm. In 2014 5th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems, pages 54–60.
  42. Mr. Scan: Extreme scale density-based clustering using a tree-based network of GPGPU nodes. In SC ’13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, pages 1–11.
  43. A Fast Parallel Clustering Algorithm for Large Spatial Databases. Data Mining and Knowledge Discovery, 3(3):263–290.
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now