In this work, we retarget an existing GPU graph algorithm compiler to obtain the first graph framework that uses SIMD extensions on CPUs to efficiently execute ...

In this work, we retarget an existing GPU graph algorithm compiler to obtain the first graph framework that uses SIMD extensions on CPUs to efficiently execute ...

Sep 17, 2021 · Applying our SIMD-targeted optimizations improves the plain SIMD implementation by 1.67x, outperforming a serial implementation by 12.46x. On ...

Duration: 20:37
Posted: Sep 14, 2021

10:15. 15m. Talk. Efficient Execution of Graph Algorithms on CPU with SIMD Extensions Results Reproduced v1.1 Artifacts Evaluated – Reusable v1.1 Artifact ...

Efficient execution of graph algorithms on CPU with SIMD extensions. R Zheng, S Pai. 2021 IEEE/ACM International Symposium on Code Generation and Optimization …

Abstract—This paper targets automatic performance tuning of numerical kernels in the presence of multi-layered memory hierarchies and SIMD parallelism.

This paper proposes a simple programming API with unintuitive interface for expressing SIMD parallelism, and develops efficient techniques for supporting the ...

This paper investigates the opportunities given by SIMD capabilities of modern CPUs to the end of efficiently evaluating regression trees ensembles. We propose ...

Nov 27, 2023 · Designing a good, fast, portable SIMD algorithm is not a simple matter and requires thinking a little bit like a circuit designer. Here's the ...