Parallel clustering on the star graph

Authors:
M. Fazeli;H. Sarbazi-Azad;R. Farivar
Affiliations:
Sharif University of Technology and IPM School of Computer Science;Sharif University of Technology and IPM School of Computer Science;Sharif University of Technology and IPM School of Computer Science
Venue:
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Year:
2005

Citing 5
Cited 1

Optimal Information Dissemination in Star and Pancake Networks

IEEE Transactions on Parallel and Distributed Systems
Digital Picture Processing

Digital Picture Processing
Computer Vision

Computer Vision
A parallel algorithm for Lagrange interpolation on the star graph

Journal of Parallel and Distributed Computing
Clustering on a Hypercube Multicomputer

IEEE Transactions on Parallel and Distributed Systems

Multi-group QoS consensus for web services

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

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+S2– T2) 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.