Parallel Performance Studies for a Clustering Algorithm

Thumbnail Image

Files

BlasbergGobbertTR2008clustering.pdf (296.03 KB)

Links to Files

https://userpages.umbc.edu/~gobbert/papers/BlasbergGobbertTR2008clustering.pdf

Permanent Link

http://hdl.handle.net/11603/11676

Collections

UMBC Mathematics and Statistics Department
UMBC Faculty Collection

Author/Creator

Author/Creator ORCID

Date

2008

Type of Work

Technical Report
Text

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.

Subjects

Parallel Performance
Clustering Algorithm
datapoints
memory-optimal
UMBC High Performance Computing Facility (HPCF)
affinity propagation

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.