Skip to main content

FPGA-Based Parallel DBSCAN Architecture

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8405))

Abstract

Clustering of a large number of data points is a computational demanding task that often needs the be accelerated in order to be useful in practice. The focus of this work is on the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm, which is one of the state-of-the-art clustering algorithms, targeting its acceleration using an FPGA device. The paper presents a novel, optimised and scalable architecture that takes advantage of the internal memory structure of modern FPGAs in order to deliver a high performance clustering system. Results show that the developed system can obtain average speed-ups of 32x in real-world tests and 202x in synthetic tests when compared to state-of-the-art software counterparts.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A Density-Based Algorithm for Discovering Clusters. In: Proc. of 2nd International Conference on Knowledge Discovery and Data Mining, Portland, OR, pp. 226–231 (1996)

    Google Scholar 

  2. Daszykowski, M., Walczak, B., Massart, D.L.: Looking for Natural Patterns in Data. Part 1: Density Based Approach. Chemometrics and Intelligent Laboratory Systems 56(2), 83–92 (2001)

    Article  Google Scholar 

  3. Thapa, R., Trefftz, C., Wolffe, G.: Memory-Efficient Implementation of a Graphics Processor-Based Cluster Detection Algorithm for Large Spatial Databases. In: Proc. of the IEEE International Conference on Electro/Information Technology (EIT), vol. 1(5), pp. 20–22 (2010)

    Google Scholar 

  4. He, Y., Tan, H., Luo, W., Mao, H., Ma, D., Feng, S., Fan, J.: MR-DBSCAN: An Efficient Parallel Density-Based Clustering Algorithm Using MapReduce. In: Proc. of the IEEE 17th International Conference on Parallel and Distributed Systems (ICPADS), vol. 7(9), pp. 473–480 (2011)

    Google Scholar 

  5. Hartigan, J.A., Wong, M.A.: A K-Means Clustering Algorithm. Journal of the Royal Statistical Society, Series C 28(1), 100–108 (1979)

    MATH  Google Scholar 

  6. Ankerst, M., Breunig, M.M., Kriegel, H.-P., Sander, J.: OPTICS: Ordering Points To Identify the Clustering Structure. In: Proc. of the ACM SIGMOD International Conference on Management of Data, vol. 28(2), pp. 49–60 (1999)

    Google Scholar 

  7. Maruyama, T.: Real-time K-Means Clustering for Color Images on Reconfigurable Hardware. In: Proc. of 18th International Conference on Pattern Recognition (ICPR), vol. 2(1), pp. 816–819 (2006)

    Google Scholar 

  8. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. of ACM SIGMOD Int. Conf. on Management of Data, Atlantic City, NJ, pp. 322–331 (1990)

    Google Scholar 

  9. Chen, M., Gao, X., Li, H.: Parallel DBSCAN with Priority R-Tree. In: Proc. of the 2nd IEEE International Conference on Information Management and Engineering (ICIME), vol. 16(18), pp. 508–511 (2010)

    Google Scholar 

  10. Li, L., Xi, Y.: Research on Clustering Algorithm and Its Parallelization Strategy. In: Proc. of the International Conference on Computational and Information Sciences (ICCIS), vol. 21(23), pp. 325–328 (2011)

    Google Scholar 

  11. Shimada, A., Zhu, H., Shibata, T.: A VLSI DBSCAN Processor Composed as an Array of Micro Agents Having Self-Growing Interconnects. In: Proc. of the IEEE International Symposium on Circuits and Systems (ISCAS), vol. 19(23), pp. 2062–2065 (2013)

    Google Scholar 

  12. Achtert, E., Kriegel, H.-P., Schubert, E., Zimek, A.: Interactive Data Mining with 3D-Parallel-Coordinate-Trees. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, New York, NY, pp. 1009–1012 (2013)

    Google Scholar 

  13. Xiang, X., Tuo, S., Pranav, V., Jaehwan, J.L.: R-tree: A Hardware Implementation. In: Proceedings of the 2008 International Conference on Computer Design (CDES), Las Vegas, NV, pp. 3–9 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Scicluna, N., Bouganis, CS. (2014). FPGA-Based Parallel DBSCAN Architecture. In: Goehringer, D., Santambrogio, M.D., Cardoso, J.M.P., Bertels, K. (eds) Reconfigurable Computing: Architectures, Tools, and Applications. ARC 2014. Lecture Notes in Computer Science, vol 8405. Springer, Cham. https://doi.org/10.1007/978-3-319-05960-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-05960-0_1

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-05959-4

  • Online ISBN: 978-3-319-05960-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics