"A parallel data clustering algorithm for Intel MIC accelerators"
Rechkalov T.V. and Zymbler M.L.

The PAM (Partitioning Around Medoids) is a partitioning clustering algorithm where each cluster is represented by an object from the input dataset (called a medoid). The medoid-based clustering is used in a wide range of applications: the segmentation of medical and satellite images, the analysis of DNA microarrays and texts, etc. Currently, there are parallel implementations of PAM for GPU and FPGA systems, but not for Intel Many Integrated Core (MIC) accelerators. In this paper, we propose a novel parallel PhiPAM clustering algorithm for Intel MIC systems. Computations are parallelized by the OpenMP technology. The algorithm exploits a sophisticated memory data layout and loop tiling technique, which allows one to efficiently vectorize computations with Intel MIC. Experiments performed on real data sets show a good scalability of the algorithm.

Keywords: clustering, medoid, parallel algorithm, OpenMP, Intel Xeon Phi, data layout, vectorization of computations.

  • Rechkalov T.V. – South Ural State University, School of Electronic Engineering and Computer Science; prospekt Lenina 76, Chelyabinsk, 454080, Russia; Graduate Student, e-mail: trechkalov@yandex.ru
  • Zymbler M.L. – South Ural State University, School of Electronic Engineering and Computer Science; prospekt Lenina 76, Chelyabinsk, 454080, Russia; Ph.D., Associate Professor, Head of Department, e-mail: mzym@susu.ru