Parallelization of a Hierarchical Data Clustering Algorithm Using OpenMP

Panagiotis E. Hadjidoukas, Laurent Amsaleg

Abstract

This paper presents a parallel implementation of CURE, an efficient hierarchical data clustering algorithm, using the OpenMP programming model. OpenMP provides a means of transparent management of the asymmetry and non–determinism in CURE, while our OpenMP runtime support enables the effective exploitation of the irregular nested loop–level parallelism. Experimental results for various problem parameters demonstrate the scalability of our implementation and the effective utilization of parallel hardware, which enable the use of CURE for large data sets.
BibTeX
@inproceedings{hadjidoukas2006parallelization,
  author = {Panagiotis E. Hadjidoukas and Laurent Amsaleg},
  title = {{Parallelization of a Hierarchical Data Clustering Algorithm Using OpenMP}},
  booktitle = {IWOMP},
  year = {2006},
  doi = {10.1007/978-3-540-68555-5\_24},
}

Loading related content...

Figure