paper-with-me

홈 › Papers

SparCE: Sparsity aware General Purpose Core Extensions to Accelerate Deep Neural Networks

2017-11-07 · Sanchari Sen, Shubham Jain, Swagath Venkataramani, Anand Raghunathan

Deep Neural Networks (DNNs) have emerged as the method of choice for solving a wide range of machine learning tasks. The enormous computational demands posed by DNNs have most commonly been addressed through the design of custom accelerators. However, these accelerators are prohibitive in many design scenarios (e.g., wearable devices and IoT sensors), due to stringent area/cost constraints. Accelerating DNNs on these low-power systems, comprising of mainly the general-purpose processor (GPP) cores, requires new approaches. We improve the performance of DNNs on GPPs by exploiting a key attribute of DNNs, i.e., sparsity. We propose Sparsity aware Core Extensions (SparCE)- a set of micro-architectural and ISA extensions that leverage sparsity and are minimally intrusive and low-overhead. We dynamically detect zero operands and skip a set of future instructions that use it. Our design ensures that the instructions to be skipped are prevented from even being fetched, as squashing instructions comes with a penalty. SparCE consists of 2 key micro-architectural enhancements- a Sparsity Register File (SpRF) that tracks zero registers and a Sparsity aware Skip Address (SASA) table that indicates instructions to be skipped. When an instruction is fetched, SparCE dynamically pre-identifies whether the following instruction(s) can be skipped and appropriately modifies the program counter, thereby skipping the redundant instructions and improving performance. We model SparCE using the gem5 architectural simulator, and evaluate our approach on 6 image-recognition DNNs in the context of both training and inference using the Caffe framework. On a scalar microprocessor, SparCE achieves 19%-31% reduction in application-level. We also evaluate SparCE on a 4-way SIMD ARMv8 processor using the OpenBLAS library, and demonstrate that SparCE achieves 8%-15% reduction in the application-level execution time.

📄 PDF Abstract BibTeX arXiv:1711.06315

Code (0)

등록된 구현이 없습니다.

Tasks

Attribute

Similar Papers 제목 키워드 기반

SpaRCe: Improved Learning of Reservoir Computing Systems through Sparse Representations

2019-12-04 · Luca Manneschi, Andrew C. Lin, Eleni Vasilaki

"Sparse" neural networks, in which relatively few neurons or connections are active, are common in both machine learning and neuroscience. Whereas in machine learning, "sparsity" is related to a penalty term that leads t…

BIG-bench Machine LearningDecision Making

Generating Sparse Counterfactual Explanations For Multivariate Time Series

2022-06-02 · Jana Lang, Martin Giese, Winfried Ilg, Sebastian Otte

Since neural networks play an increasingly important role in critical sectors, explaining network predictions has become a key research topic. Counterfactual explanations can help to understand why classifier models deci…

counterfactualGenerative Adversarial NetworkTime SeriesTime Series Analysis

PopSparse: Accelerated block sparse matrix multiplication on IPU

2023-03-29 · Zhiyi Li, Douglas Orr, Valeriu Ohan, Godfrey Da Costa 외

Reducing the computational cost of running large scale neural networks using sparsity has attracted great attention in the deep learning community. While much success has been achieved in reducing FLOP and parameter coun…

GPU

PreMoE: Proactive Inference for Efficient Mixture-of-Experts

2025-05-23 · Zehua Pei, Ying Zhang, Hui-Ling Zhen, Tao Yuan 외 arxiv

Mixture-of-Experts (MoE) models offer dynamic computation, but are typically deployed as static full-capacity models, missing opportunities for deployment-specific specialization. We introduce PreMoE, a training-free fra…

Sparsity-Aware Evolution for Model Merging

2026-02-09 · Huan Zhang, Yanjian Zhang, Guillaume Wisniewski, Nadi Tomeh 외 arxiv

We propose a sparsity-aware evolutionary (SAE) framework for model merging that involves iterative pruning-merging cycles to act as a novel mutation operator. We incorporate the sparsity constraints into the score functi…