Oct 2026· ACM Transactions on Architecture and Code Optimization (TACO)· 0 citations· 7 references
TL;DR
TurboSparse eliminates im2col by executing SpConv directly over a DNN-oriented sparse format to reduce data movement and improve reuse, introduces row-merging micro-kernels guided by an analytical SIMD-utilization model to increase vector-lane occupancy, and fuses consecutive sparse kernels when their combined working set fits in private caches to reuse intermediates and cut memory traffic.
Abstract
Vector-wise pruning is widely used to reduce the inference cost of deep neural networks (DNNs), but it turns key operators into sparse convolution (SpConv) and sparse matrix-matrix multiplication (SpMM) kernels that are difficult to optimize on multi-core CPUs. Although prior sparse-kernel acceleration has largely centered on GPUs, CPUs remain a first-order inference platform in CPU-only deployments and in heterogeneous serving when GPUs are scarce or memory-constrained. We present TurboSparse, an approach for accelerating vector-wise sparse DNN kernels on modern multi-core CPUs. TurboSparse (1) eliminates im2col by executing SpConv directly over a DNN-oriented sparse format to reduce data movement and improve reuse, (2) introduces row-merging micro-kernels guided by an analytical SIMD-utilization model to increase vector-lane occupancy, and (3) fuses consecutive sparse kernels when their combined working set fits in private caches to reuse intermediates and cut memory traffic. Across four CPUs (x86 and ARM) and representative pruned DNN workloads, TurboSparse outperforms five expert-tuned CPU libraries, achieving up to 4.05 × speedup for consecutive SpConvs and sustaining 15–80% of each processor’s theoretical peak throughput.
Deep neural networks continue to grow in parameter count, driving up training and inference cost on GPUs. Sparse neural networks and Dynamic Sparse Training (DST) promise to reduce these costs, but most implementations rely on binary masks over dense tensors and recover little of the theoretical compute, memory, or ene...
Jafar Badour, M. van Keulen, E. Mocanu· 0 citations
AFH-SpMM is a novel Auto-Fit Heterogeneous SpMM framework designed for adaptively parallelizing sparse-dense matrix multiplication on Tensor Core-equipped GPUs that achieves average speedups of 1.33 ×, and often leads cuSPARSE, ASpT, Sputnik, RoDe, Acc-SpMM, and MP-SpMM, with especially strong gains on medium and large...
CoTC-SpMM is introduced, a cooperative Tensor–CUDA cores scheme for efficient SpMM on GPUs that first proposes the HTC format to partition sparse matrices into dense and sparse components, enabling specialized kernels to leverage the distinct advantages of different computing units and maximize hardware utilization.
Qi Du, Sheng-Le Lin, Yue-Dan Chen et al.· International Conference on...· 0 citations
Sparse–dense matrix multiplication (SpMM) underpins graph neural networks, recommendation systems, and pruned-transformer inference, yet remains memory-bound on modern GPUs because nonzero column indices induce scattered, noncoalesced accesses to the dense operand B. Recent tensor-core SpMM kernels reconstruct the spar...
Mouad Tiahi, Elmira Karimi, David R. Kaeli· IEEE International Symposium...· 0 citations
This work presents an end-to-end hardware-software co-design framework that compresses expert weights into hardware-native, low-precision sparse representations and accelerates their execution on SpTCs, establishing hardware-software co-design as a practical path toward scalable and efficient MoE deployment.
Kwanhee Lee, Namhoon Lee, Martin Jaggi· 0 citations
RODIS, a two-level acceleration scheme that utilizes row-orchestration at the data loading level to achieve inter-block load balancing and employs dynamic instruction scheduling at the underlying computation level to enhance MAC utilization, is proposed.
Jian-Feng Cui, Bo Yuan, Ze-Kun Jiang et al.· International Conference on...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.