Skip to content
Open access

Flash-DWC: Making Depthwise Convolution Compute-Efficient on GPUs

Aug 2026 · ACM Transactions on Architecture and Code Optimization (TACO) · 0 citations · 45 references

TL;DR

By making DWC compute-efficient, Flash-DWC promotes the use of larger and more expressive filters and extends forward and backward propagation to both forward and backward propagation for efficient end-to-end training.

Abstract

Depthwise convolution (DWC) is a key operator in efficient convolutional neural networks (CNNs). Recent models increasingly employ large-filter DWC to capture long-range dependencies, achieving accuracy competitive with that of vision transformers. Yet on GPUs, DWC remains far less efficient than its low FLOPs suggest and can become a runtime bottleneck, due to low arithmetic intensity, Tensor-Core mismatch, and inefficient memory access. To tackle these issues, we present Flash-DWC, a GPU library that makes DWC compute-efficient. Flash-DWC introduces a GEMV-based dataflow co-design that jointly optimizes data reuse, access order, layout, and workload tiling. This design increases arithmetic intensity, while preserving access contiguity and coalesced 128-byte memory accesses. Flash-DWC further transforms DWC GEMVs into compact high-density GEMMs on Tensor Cores, enabling efficient mixed-precision acceleration. In addition, matrix compression, a dual-path split-GEMM pipeline, and register-based input reuse further free on-chip resources, hide memory latency, and improve occupancy. We extend these techniques to both forward and backward propagation for efficient end-to-end training. Compared with the fastest cuDNN DWC algorithm, the GEMV-based CUDA-Core kernels and GEMM-based Tensor-Core kernels of Flash-DWC achieve 5.09 × and 9.01 × average speedups, respectively. In CNN training, Flash-DWC attains a 1.03 × –14.18 × speedup and matches PyTorch’s convergence on ImageNet-1K. By making DWC compute-efficient, Flash-DWC promotes the use of larger and more expressive filters.

Read PDF

Similar papers

Open access Aug 2026

A Memory-Efficient Depthwise Separable Convolution Accelerator Using Run-Length Coding

A memory-efficient hardware accelerator for depthwise separable convolution that minimizes off-chip memory traffic and parameter storage and performs the depthwise separable convolution with a small number of logic resources and on-chip memory, confirming its feasibility for resource-constrained edge devices.

Jaeseong Kim, Taehong Min, Chaebin Lee et al. · 0 citations
Preprint Aug 2026

Enabling Memory-efficient Im2win Convolution with Multi-precision Support on GPU CUDA and Tensor Cores

This work extends the im2win paradigm -- a universal, memory-efficient convolution method with contiguous memory access for all kernel sizes -- to run efficiently in full precision on CUDA cores and half precision on tensor cores, establishing im2win as a unified, high-performance convolution framework for modern GPU a...

Xiang Fu, Jixiang Ma, Xinpeng Zhang et al. · 1 citation
Oct 2026

An Energy-Efficient Sparse MobileNetV1 FPGA Accelerator With Chained Depthwise Separable Convolution and Computation-Aware Pruning

MobileNet has been widely adopted in mobile applications due to its lightweight architecture based on depthwise separable convolution (DSC). However, developing an efficient MobileNet accelerator remains hard as the DSC consists of two heterogeneous operations, depthwise convolution (DWC) and pointwise convolution (PWC...

Euijun Hong, Suchang Kim · 0 citations
Preprint Aug 2026

Fast and Memory-Efficient Wavelet Convolutions via I/O-Aware Reformulation

The reformulation preserves the benefits of WTConv while substantially reducing its execution time and memory footprint, removing the systems overhead that previously limited its practical efficiency.

Amit Aflalo, Shahaf E. Finder, Roy Amoyal et al. · 0 citations
Preprint Aug 2026

Group-Shared Low-Rank Approximation for Mobile-Efficient Pointwise Convolutions in Large-Kernel CNNs

Channel Group-Shared (CGS) low-rank approximation, a novel Singular Value Decomposition (SVD)-based parameter-sharing strategy, enables the feasible deployment of pre-trained large-kernel CNN models on edge devices, thereby bridging the gap between high-performance vision models and practical edge deployment.

Hao Luo, Yi-Ting Yang, Wen-Yi Zhao et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.