Skip to main content

Active Storage Networks for Accelerating K-Means Data Clustering

  • Conference paper
Reconfigurable Computing: Architectures, Tools and Applications (ARC 2011)

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

Included in the following conference series:

Abstract

High performance computing systems are often inhibited by the performance of their storage systems and their ability to deliver data. Active Storage Networks (ASN) provide an opportunity to optimize storage system and computational performance by offloading computation to the network switch. An ASN is based around an intelligent network switch that allows data processing to occur on data as it flows through the storage area network from storage nodes to client nodes. In this paper, we demonstrate an ASN used to accelerate K-means clustering. The \(K-means\ data\ clustering\) algorithm is a compute intensive scientific data processing algorithm. It is an iterative algorithm that groups a large set of multidimensional data points in to k distinct clusters. We investigate functional and data parallelism techniques as applied to the K-means clustering problem and show that the in-network processing of an ASN greatly improves performance.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gibson, G.A., Meter, R.V.: Network attached storage architecture. Commun. ACM 43(11), 37–45 (2000)

    Article  Google Scholar 

  2. Estlick, M., Leeser, M., Theiler, J., Szymanski, J.J.: Algorithmic transformations in the implementation of k- means clustering on reconfigurable hardware. In: Proceedings of the 2001 Ninth International Symposium on Field Programmable Gate Arrays, FPGA 2001, pp. 103–110. ACM, New York (2001)

    Chapter  Google Scholar 

  3. da Filho, A.G., Frery, A.C., de Araújo, C.C., Alice, H., Cerqueira, J., Loureiro, J.A., de Lima, M.E., das Graças, M., Oliveira, S., Horta, M.M.: Hyperspectral images clustering on reconfigurable hardware using the k-means algorithm. In: Proceedings of the 16th Symposium on Integrated Circuits and Systems Design, SBCCI 2003, p. 99. IEEE Computer Society, Los Alamitos (2003)

    Google Scholar 

  4. http://www.netfpga.org

  5. Son, S.W., Lang, S., Carns, P., Ross, R., Thakur, R., Ozisikyilmaz, B., Kumar, P., Liao, W.K., Choudhary, A.: Enabling active storage on parallel I/O software stacks. In: Proceedings of 26th IEEE Conference on Mass Storage Systems and Technologies, MSST 2010 (2010)

    Google Scholar 

  6. Thamarakuzhi, A., Chandy, J.A.: 2-dilated flattened butterfly: A nonblocking switching network. In: 11th International Conference on High Performance Switching and Routing, HPSR 2010, Texas, USA (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Singaraju, J., Chandy, J.A. (2011). Active Storage Networks for Accelerating K-Means Data Clustering. In: Koch, A., Krishnamurthy, R., McAllister, J., Woods, R., El-Ghazawi, T. (eds) Reconfigurable Computing: Architectures, Tools and Applications. ARC 2011. Lecture Notes in Computer Science, vol 6578. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19475-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19475-7_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19474-0

  • Online ISBN: 978-3-642-19475-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics