A parallel clustering algorithm on the star graph and its performance

作者：Sarbazi Azad Hamid^*; Zarandi Hamid R; Fazeli Mahdi

来源：Mathematical and Computer Modelling, 2013, 58(3-4): 880-891.

DOI：10.1016/j.mcm.2013.03.011

• Interconnection networks
• Star graph
• Clustering
• Parallel algorithm
• Complexity

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 + S-2 - T-2) 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 %26lt;= S! and KM %26lt;= T!, on the S-dimensional star graph.

• 出版日期2013-8