Loading...

Parallel clustering on the star graph

Fazeli, M ; Sharif University of Technology | 2005

237 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/11564621_32
  3. Publisher: 2005
  4. Abstract:
  5. 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. © Springer-Verlag Berlin Heidelberg 2005
  6. Keywords:
  7. Clustering problem ; Processing elements ; S-star interconnection network ; Star topology ; Data reduction ; Distributed computer systems ; Graph theory ; Parallel algorithms ; Parallel processing systems
  8. Source: 6th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP, Melbourne, 2 October 2005 through 3 October 2005 ; Volume 3719 LNCS , 2005 , Pages 287-292 ; 03029743 (ISSN); 3540292357 (ISBN); 9783540292357 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007/11564621_32