Performance of Multicore Systems on Parallel Data Clustering with Deterministic Annealing

Authors:
Xiaohong Qiu;Geoffrey C. Fox;Huapeng Yuan;Seung-Hee Bae;George Chrysanthakopoulos;Henrik Frystyk Nielsen
Affiliations:
Research Computing UITS, Indiana University Bloomington,;Community Grids Lab, Indiana University Bloomington,;Community Grids Lab, Indiana University Bloomington,;Community Grids Lab, Indiana University Bloomington,;Microsoft Research Redmond WA,;Microsoft Research Redmond WA,
Venue:
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Year:
2008

Citing 4
Cited 2

Solving problems on concurrent processors. Vol. 1: General techniques and regular problems

Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Sourcebook of parallel computing

Sourcebook of parallel computing
Special Issue: Workflow in Grid Systems: Editorials

Concurrency and Computation: Practice & Experience - Workflow in Grid Systems
High Performance Multi-paradigm Messaging Runtime Integrating Grids and Multicore Systems

E-SCIENCE '07 Proceedings of the Third IEEE International Conference on e-Science and Grid Computing

Biomedical Case Studies in Data Intensive Computing

CloudCom '09 Proceedings of the 1st International Conference on Cloud Computing
Performance of Windows Multicore Systems on Threading and MPI

CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a performance analysis of a scalable parallel data clustering algorithm with deterministic annealing for multicore systems that compares MPI and a new C# messaging runtime library CCR (Concurrency and Coordination Runtime) with Windows and Linux and using both threads and processes. We investigate effects of memory bandwidth and fluctuations of run times of loosely synchronized threads. We give results on message latency and bandwidth for two processor multicore systems based on AMD and Intel architectures with a total of four and eight cores. We compare our C# results with C using MPICH2 and Nemesis and Java with both mpiJava and MPJ Express. We show initial speedup results from Geographical Information Systems and Cheminformatics clustering problems. We abstract the key features of the algorithm and multicore systems that lead to the observed scalable parallel performance.