Skip to main content

Parallel Clustering on the Star Graph

  • Conference paper

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

Abstract

In this paper, a parallel algorithm for data clustering is presented on a multi-computer with star topology. This algorithm is fast and requires a small amount of memory per processing element, which makes it even suitable for SIMD implementation. The proposed parallel algorithm completes in O(K+S 2 – T 2) steps for a clustering problem of N data patterns with M features per pattern and K clusters, where N.M = S!, K.M = T!, and M=R!, on a s-star interconnection network.

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. Sarbazi-Azad, H., Ould-Khaoua, M., Mackenzie, L.M., Akl, S.G.: A parallel algorithm for Lagrange interpolation the star graph. Journal of Parallel and Distributed Computing 62, 605–621 (2002)

    Article  MATH  Google Scholar 

  2. Fazeli, M., Sarbazi-Azad, H., Farivar, R.: Parallel Clustering on the Star Graph. Technical Report, IPM school of Computer Science (2005)

    Google Scholar 

  3. Akl, S., Qiu, K.: A novel routing scheme on the star and pancake networks and its applications. Parallel Computing 19(1), 95–101 (1993)

    Article  MATH  Google Scholar 

  4. Berthone, P., Ferreira, A., Perennes, S.: Optimal Information Dissemination in Star and Pancake networks. IEEE TPDS 7, 1292–1300 (1996)

    Google Scholar 

  5. Ranka, S., Sahni, S.: Clustering on a hypercube multicomputer. IEEE TPDS 2(2), 71–82 (1991)

    Google Scholar 

  6. Ballard, D.H., Brown, C.M.: Computer vision. Prentice-Hall, Englewood Cliffs (1985)

    Google Scholar 

  7. Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. Wiley, New York (1973)

    MATH  Google Scholar 

  8. Fu, K.S.: Syntactic Methods in Pattern Recognition. Academic Press, New York (1974)

    MATH  Google Scholar 

  9. Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, New York (1972)

    Google Scholar 

  10. Rosenfeld, A., Kak, A.C.: Digital Picture Processing. Academic, New York (1982)

    Google Scholar 

  11. Tou, J.T., Gonzalez, R.C.: Pattern Recognition principles. Addison-Wesley, Reading (1974)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fazeli, M., Sarbazi-Azad, H., Farivar, R. (2005). Parallel Clustering on the Star Graph. In: Hobbs, M., Goscinski, A.M., Zhou, W. (eds) Distributed and Parallel Computing. ICA3PP 2005. Lecture Notes in Computer Science, vol 3719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564621_32

Download citation

  • DOI: https://doi.org/10.1007/11564621_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29235-7

  • Online ISBN: 978-3-540-32071-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics