arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.04669cs.DC
收藏

多核和众核处理器上的并行空间节省

Parallel Space Saving on Multi and Many-Core Processors

Massimo Cafaro, Marco Pulimeno, Italo Epicoco, Giovanni Aloisio

摘要:

给定$n$元素的数组$\mathcal{A}$和值$2 \leq k \leq n$,频繁项或$k$多数元素是在$\mathcal{A}$中出现多于$n/k$次数的元素。$k$多数问题需要找到所有$k$多数元素。在本文中,我们处理频繁项的并行共享内存算法,我们提出了一个共享内存版本的节省空间算法,我们研究其行为方面的准确性和性能在许多多核处理器,包括英特尔Phi加速器。我们还调查了一个混合MPI/OpenMP版本对一个纯MPI为基础的版本。通过大量的实验结果,我们证明了MPI/OpenMP并行版本的算法显着提高了性能的早期纯MPI版本的相同的算法。结果还证明,对于该算法,英特尔Phi加速器相对于至强八核处理器没有任何改进。

英文摘要:

Given an array $\mathcal{A}$ of $n$ elements and a value $2 \leq k \leq n$, a frequent item or $k$-majority element is an element occurring in $\mathcal{A}$ more than $n/k$ times. The $k$-majority problem requires finding all of the $k$-majority elements. In this paper we deal with parallel shared-memory algorithms for frequent items; we present a shared-memory version of the Space Saving algorithm and we study its behavior with regard to accuracy and performance on many and multi-core processors, including the Intel Phi accelerator. We also investigate a hybrid MPI/OpenMP version against a pure MPI based version. Through extensive experimental results we prove that the MPI/OpenMP parallel version of the algorithm significantly enhances the performance of the earlier pure MPI version of the same algorithm. Results also prove that for this algorithm the Intel Phi accelerator does not introduce any improvement with respect to the Xeon octa-core processor.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑