arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.13006cs.DCcs.AI
收藏

Accelerating Sparse DNN Models without Hardware-Support via Tile-Wise Sparsity

Shanghai Jiao Tong University(上海交通大学);NVIDIA(英伟达);Shanghai Qi Zhi Institute(上海期智研究院);University of Rochester(罗切斯特大学)

Cong Guo, Bo Yang Hsueh, Jingwen Leng, Yuxian Qiu, Yue Guan, Zehuan Wang, Xiaoying Jia, Xipeng Li, Minyi Guo, Yuhao Zhu

英文摘要:

Network pruning can reduce the high computation cost of deep neural network (DNN) models. However, to maintain their accuracies, sparse models often carry randomly-distributed weights, leading to irregular computations. Consequently, sparse models cannot achieve meaningful speedup on commodity hardware (e.g., GPU) built for dense matrix computations. As such, prior works usually modify or design completely new sparsity-optimized architectures for exploiting sparsity. We propose an algorithm-software co-designed pruning method that achieves latency speedups on existing dense architectures. Our work builds upon the insight that the matrix multiplication generally breaks the large matrix into multiple smaller tiles for parallel execution. We propose a tiling-friendly "tile-wise" sparsity pattern, which maintains a regular pattern at the tile level for efficient execution but allows for irregular, arbitrary pruning at the global scale to maintain the high accuracy. We implement and evaluate the sparsity pattern on GPU tensor core, achieving a 1.95x speedup over the dense model.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑