Performance Evaluation of Large-Scale Parallel Clustering in NOW Environments

This paper presents the results of a performance study of parallel data clustering on Network of Workstations (NOW) platforms. The clustering program, P-CLUSTER, is based on the mean square-error clustering algorithm and is applied to the problem of image segmentation. The parallel implementation uses a client-server model, in which the clustering task is divided among a set of clients that report their intermediate results to a single server process. Results of experiments on four NOW platforms are presented, illustrating the eeects on performance of diierent processors, network architectures, communication packages, and latency hiding techniques.

[1]  Anil K. Jain,et al.  Large-Scale Parallel Data Clustering , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[3]  Vaidy S. Sunderam,et al.  PVM: A Framework for Parallel Distributed Computing , 1990, Concurr. Pract. Exp..

[4]  Anil K. Jain,et al.  Unsupervised texture segmentation using Gabor filters , 1990, 1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings.

[5]  Message Passing Interface Forum MPI: A message - passing interface standard , 1994 .

[6]  Anil K. Jain,et al.  Parallel implementation of vision algorithms on workstation clusters , 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 2 - Conference B: Computer Vision & Image Processing. (Cat. No.94CH3440-5).

[7]  H. P. Friedman,et al.  On Some Invariant Criteria for Grouping Data , 1967 .