paper-with-me

홈 › Papers

Parallelized Kendall's Tau Coefficient Computation via SIMD Vectorized Sorting On Many-Integrated-Core Processors

2017-04-12 · Yongchao Liu, Tony Pan, Oded Green, Srinivas Aluru

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.

📄 PDF Abstract BibTeX arXiv:1704.03767

Code (0)

등록된 구현이 없습니다.

Tasks

Distributed Computing

Similar Papers 제목 키워드 기반

Decoding billions of integers per second through vectorization

2012-09-10 · Daniel Lemire, Leonid Boytsov

In many important applications -- such as search engines and relational database systems -- data is stored in the form of arrays of integers. Encoding and, most importantly, decoding of these arrays consumes considerable…

CPU

Massively Parallel Graph Drawing and Representation Learning

2020-11-06 · Christian Böhm, Claudia Plant

To fully exploit the performance potential of modern multi-core processors, machine learning and data mining algorithms for big data must be parallelized in multiple ways. Today's CPUs consist of multiple cores, each fol…

Graph EmbeddingGraph Representation LearningRepresentation Learning

A General SIMD-based Approach to Accelerating Compression Algorithms

2015-02-06 · Wayne Xin Zhao, Xu-Dong Zhang, Daniel Lemire, Dongdong Shan 외

Compression algorithms are important for data oriented tasks, especially in the era of Big Data. Modern processors equipped with powerful SIMD instruction sets, provide us an opportunity for achieving better compression …

Vec-QMDP: Vectorized POMDP Planning on CPUs for Real-Time Autonomous Driving

2026-02-09 · Xuanjin Jin, Yanxin Dong, Bin Sun, Huan Xu 외 arxiv

Planning under uncertainty for real-world robotics tasks, such as autonomous driving, requires reasoning in enormous high-dimensional belief spaces, rendering the problem computationally intensive. While parallelization …

Autonomous Driving

SimdBench: Benchmarking Large Language Models for SIMD-Intrinsic Code Generation

2025-07-21 · Yibo He, Shuoran Zhao, Jiaming Huang, Yingjie Fu 외 arxiv

SIMD (Single Instruction Multiple Data) instructions and their compiler intrinsics are widely supported by modern processors to accelerate performance-critical tasks. SIMD intrinsic programming, a trade-off between codin…

Code Generation