Parallelized Kendall's Tau Coefficient Computation via SIMD Vectorized Sorting On Many-Integrated-Core Processors
원문 초록
Pairwise association measure is an important operation in data analytics. Kendall's tau coefficient is one widely used correlation coefficient identifying non-linear relationships between ordinal variables. In this paper, we investigated a parallel algorithm accelerating all-pairs Kendall's tau coefficient computation via single instruction multiple data (SIMD) vectorized sorting on Intel Xeon Phis by taking advantage of many processing cores and 512-bit SIMD vector instructions. To facilitate workload balancing and overcome on-chip memory limitation, we proposed a generic framework for symmetric all-pairs computation by building provable bijective functions between job identifier and coordinate space. Performance evaluation demonstrated that our algorithm on one 5110P Phi achieves two orders-of-magnitude speedups over 16-threaded MATLAB and three orders-of-magnitude speedups over sequential R, both running on high-end CPUs. Besides, our algorithm exhibited rather good distributed computing scalability with respect to number of Phis. Source code and datasets are publicly available at http://lightpcc.sourceforge.net.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Correlations Are Ruining Your Gradient Descent
SacFL: Self-Adaptive Federated Continual Learning for Resource-Constrained End Devices
Tree-Guided $L_1$-Convex Clustering
Distributed LLMs and Multimodal Large Language Models: A Survey on Advances, Challenges, and Future Directions
Benchmarking Dynamic SLO Compliance in Distributed Computing Continuum Systems
Distributed Mixture-of-Agents for Edge Inference with Large Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.