“School of Computer Science”
Back to Papers HomeBack to Papers of School of Computer Science
| Paper IPM / Computer Science / 11104 |
|
||||||
| 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 = SI, KM = TI, and M=Rl, on a s-star interconnection network.
Download TeX format |
|||||||
| back to top | |||||||
