|
A parallel data clustering algorithm for Intel MIC accelerators
T. V. Rechkalov, M. L. Tsymbler South Ural State University, Chelyabinsk
Abstract:
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:
OpenMP, Intel Xeon Phi, clustering, medoid, parallel algorithm, OpenMP, Intel Xeon Phi, data layout, vectorization of computations.
Received: 26.02.2019
Citation:
T. V. Rechkalov, M. L. Tsymbler, “A parallel data clustering algorithm for Intel MIC accelerators”, Num. Meth. Prog., 20:2 (2019), 104–115
Linking options:
https://www.mathnet.ru/eng/vmp952 https://www.mathnet.ru/eng/vmp/v20/i2/p104
|
Statistics & downloads: |
Abstract page: | 111 | Full-text PDF : | 45 |
|