Loading...

A parallel clustering algorithm on the star graph and its performance

Sarbazi Azad, H ; Sharif University of Technology

950 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.mcm.2013.03.011
  3. Abstract:
  4. In this paper, a parallel algorithm is presented for data clustering on a multicomputer 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+S2-T2) steps for a clustering problem of N data patterns with M features per pattern and K clusters where S and T are the minimum numbers such that NM≤S! and KM≤T!, on the S-dimensional star graph
  5. Keywords:
  6. Clustering ; Complexity ; Interconnection networks ; Parallel algorithm ; Star graph ; Clustering problems ; Data clustering ; Multicomputers ; Processing elements ; Star graphs ; Star topology ; Electric network topology ; Parallel algorithms ; Parallel architectures ; Clustering algorithms
  7. Source: Mathematical and Computer Modelling ; Volume 58, Issue 3-4 , 2013 , Pages 880-891 ; 08957177 (ISSN)
  8. URL: http://www.sciencedirect.com/science/article/pii/S0895717713001258