Parallel Performance Studies for a Clustering Algorithm
Loading...
Permanent Link
Author/Creator
Author/Creator ORCID
Date
2008
Type of Work
Department
Program
Citation of Original Publication
Rights
This item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.
Abstract
Affinity propagation is a clustering algorithm that functions by identifying similar datapoints in an iterative process. Its structure allows for taking full advantage of parallel computing by enabling the solution of larger problems and by solving them faster than possible in serial. We show that our memory-optimal implementation with minimal number of communication commands per iteration performs excellently on the distributed-memory cluster hpc and that it is efficient to use all 128 processor cores currently available.