Efficient parallel hierarchical clustering algorithms

IEEE Transactions on Parallel and Distributed Systems

Volumn 16, Issue 6, 2005, Pages 497-502

  Rajasekaran, Sanguthevar ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

Hierarchical clustering; Mesh connected computers; Meshes with optical buses; PRAMs; Reconfigurable networks; Single link metric

Indexed keywords

COMPUTER NETWORKS; MATHEMATICAL MODELS; PARALLEL ALGORITHMS; RANDOM ACCESS STORAGE; THEOREM PROVING;

HIERARCHICAL CLUSTERING; MESH CONNECTED COMPUTERS; PARALLEL RANDOM ACCESS MACHINES (PRAMS); RECONFIGURABLE NETWORKS; SINGLE LINK METRIC;

PARALLEL PROCESSING SYSTEMS;

EID: 21244466861     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2005.72     Document Type: Article

References (24)

1. Y. Ben-Asher, D. Peleg, R. Ramaswami, and A. Schuster, "The Power of Reconfiguration,' J. Parallel and Distributed Computing, pp. 139-153, 1991.
2. B. Chazelle, "A Minimum Spanning Tree Algorithm with Inverse-Ackerman Type Complexity," J. ACM, vol. 47, no. 6, pp. 1028-1047, 2000.
3. H. Gazit, "An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph," SIAM J. Computing, vol. 20, no. 6, pp. 1046-1067, 1991.
4. E. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms. W.H. Freeman Press, 1998.
5. J. JáJá, An Introduction to Parallel Algorithms. Addison-Wesley Publishing Company, 1992.
6. J. Jang and V.K. Prasanna, "An Optimal Sorting Algorithm on Reconfigurable Mesh," Proc. Int'l Parallel Processing Symp., pp. 130-137, 1992.
7. D.R. Karger, P.N. Klein, and R.E. Tarjan, "A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees," J. ACM, vol. 42, no. 2, pp. 321-328, 1995.
8. X. Li, "Parallel Algorithms for Hierarchical Clustering and Clustering Validity," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, pp. 1088-1092, 1990.
9. X. Li and Z. Fang, "Parallel Algorithms for Clustering on Hypercube SIMD Computers," Proc. 1986 Conf. Computer Vision and Pattern Recognition, pp. 130-133, 1986.
10. X. Li and Z. Fang, "Parallel Clustering Algorithms," Parallel Computing, vol. 11, pp. 275-290, 1989.
11. R.G. Melhem, D.M. Chiarulli, and S.P. Levitan, "Space Multiplexing of Waveguides in Optically Interconnected Multiprocessor Systems," Computer J., vol. 32, no. 4, pp. 362-369, 1989.
12. C.F. Olson, "Parallel Algorithms for Hierarchical Clustering," Parallel Computing, vol. 21, pp. 1313-1325, 1995.
13. S. Pavel and S.G. Akl, "Matrix Operations Using Arrays with Reconfigurable Optical Buses," manuscript, 1995.
14. S. Pavel and S.G. Akl, "Integer Sorting and Routing in Arrays with Reconfigurable Optical Buses," Int'l J. Foundations of Computer Science, vol. 9, pp. 99-120, 1998.
15. S. Pettie and V. Ramachandran, "A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest," Proc. Random-Approx Conf. '99, pp. 233-244, 1999.
16. R.C. Prim, "Shortest Connection Networks and Some Generalizations," Bell System Technical J., vol. 36, pp. 1389-1401, 1957.
17. S. Rajasekaran, "On the Euclidean Minimum Spanning Tree Problem," technical report BECAT/CSE, Univ. of Connecticut, 2004.
18. S. Rajasekran and J.H. Reif, "Optimal and Sub-Logarithmic Time Randomized Parallel Sorting Algorithms," SIAM J. Computing, vol. 18, no. 3, pp. 594-607, 1989.
19. S. Rajasekaran and S. Sahni, "Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 11, pp. 1123-1131, Nov. 1997.
20. S. Ranka and S. Sahni, "Clustering on a Hypercube Multicomputer," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 2, pp. 129-136, 1991.
21. M.I. Shamos and D.J. Hoey, "Closest-Point Problems," Proc. 16th Ann. IEEE Symp. Foundations of Computer Science, pp. 151-162, 1975.,
22. H.R. Tsai, S.J. Horng, S.S. Lee, S.S. Tsai, and T.W. Kao, "Parallel Hierarchical Clustering Algorithms on Processor Arrays with a Reconfigurable Bus System," Pattern Recognition, vol. 30, pp. 801-815, 1997.
23. C.-H. Wu, S.-J. Horng, and H.-R. Tsai, "Efficient Parallel Algorithms for Heirarchical Clustering on Arrays with Reconfigurable Optical Buses," J. Parallel and Distributed Computing, 60, pp. 1137-1153, 2000.
24. A. Yao, "On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems," SIAM J. Computing, vol. 11, no. 4, pp. 721-736, 1982.