Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Negar Goli

dblp:230/4535 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Hardware accelerators and domain-specific architectures · 100%
Artificial intelligence
2 papers
Efficient and distributed learning · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures
redundant computation elimination
0.612022
Anticipating and eliminating redundant computations in accelerated sparse training · ISCA 2022
Hardware accelerators and domain-specific architectures › machine learning accelerator › DNN training accelerator
sparse DNN training accelerator
0.612022
Anticipating and eliminating redundant computations in accelerated sparse training · ISCA 2022
Machine learning › Efficient and distributed learning › sparse computation
sparse backpropagation
0.412020
ReSprop: Reuse Sparsified Backpropagation · CVPR 2020
Machine learning › Efficient and distributed learning › efficient training
training acceleration
0.412020
ReSprop: Reuse Sparsified Backpropagation · CVPR 2020
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.412020
ReSprop: Reuse Sparsified Backpropagation · CVPR 2020
Hardware accelerators and domain-specific architectures › sparsity exploitation
sparse convolution accelerator
0.412020
ReSprop: Reuse Sparsified Backpropagation · CVPR 2020
Machine learning › Efficient and distributed learning › model compression
sparse training
0.212022
Anticipating and eliminating redundant computations in accelerated sparse training · ISCA 2022

Methods — techniques the papers use, named apart from their topics

gradient sparsification · 0.9backpropagation · 0.9
YearPublicationVenuePosition
2022 Anticipating and eliminating redundant computations in accelerated sparse training
abstract
Deep Neural Networks (DNNs) are the state of art in image, speech, and text processing. To address long training times and high energy consumption, custom accelerators can exploit sparsity, that is zero-valued weights, activations, and gradients. Proposed sparse Convolution Neural Network (CNN) accelerators support training with no more than one dynamic sparse convolution input. Among existing accelerator classes, the only ones supporting two-sided dynamic sparsity are outer-product-based accelerators. However, when mapping a convolution onto an outer product, multiplications occur that do not correspond to any valid output. These Redundant Cartesian Products (RCPs) decrease energy efficiency and performance. We observe that in sparse training, up to 90% of computations are RCPs resulting from the convolution of large matrices for weight updates during the backward pass of CNN training.
Jonathan S. Lew, Yunpeng Liu 0007, Wenyi Gong, Negar Goli, R. David Evans, Tor M. Aamodt
ISCA4
2020 ReSprop: Reuse Sparsified Backpropagation
abstract
The success of Convolutional Neural Networks (CNNs) in various applications is accompanied by a significant increase in computation and training time. In this work, we focus on accelerating training by observing that about 90% of gradients are reusable during training. Leveraging this observation, we propose a new algorithm, Reuse-Sparse-Backprop (ReSprop), as a method to sparsify gradient vectors during CNN training. ReSprop maintains state-of-the-art accuracy on CIFAR-10, CIFAR-100, and ImageNet datasets with less than 1.1% accuracy loss while enabling a reduction in back-propagation computations by a factor of 10x resulting in a 2.7x overall speedup in training. As the computation reduction introduced by Re-Sprop is accomplished by introducing fine-grained sparsity that reduces computation efficiency on GPUs, we introduce a generic sparse convolution neural network accelerator (GSCN), which is designed to accelerate sparse back-propagation convolutions. When combined with ReSprop, GSCN achieves 8.0x and 7.2x speedup in the backward pass on ResNet34 and VGG16 versus a GTX 1080 Ti GPU.
Negar Goli, Tor M. Aamodt
CVPR1
2019 Analyzing Machine Learning Workloads Using a Detailed GPU Simulator
abstract
Machine learning (ML) has recently emerged as an important application driving future architecture design. Traditionally, architecture research has used detailed simulators to model and measure the impact of proposed changes. However, current open-source, publicly available simulators lack support for running a full ML stack like PyTorch. High-confidence, cycle-accurate simulations are crucial for architecture research and without them, it is difficult to rapidly prototype new ideas. In this paper, we describe changes we made to GPGPU-Sim, a popular, widely used GPU simulator, to run ML applications that use cuDNN and PyTorch, two widely used frameworks for running Deep Neural Networks (DNNs). This work has the potential to enable significant microarchitectural research into GPUs for DNNs. Our results show that the modified simulator, which has been made publicly available with this paper1Source code available at https://github.com/gpgpu-sim/gpgpu-sim_distribution (dev branch), provides execution time results within 18% of real hardware. We further use it to study other ML workloads and demonstrate how the simulator identifies opportunities for architectural optimization that prior tools are unable to provide.
Jonathan S. Lew, Deval Shah, Suchita Pati, Shaylin Cattell, Mengchi Zhang, Amruth Sandhupatla, Christopher Ng, Negar Goli, Matthew D. Sinclair, Timothy G. Rogers, Tor M. Aamodt
ISPASS8
2019 Modeling Deep Learning Accelerator Enabled GPUs
abstract
The efficacy of deep learning has resulted in its use in a growing number of applications. The Volta graphics processor unit (GPU) architecture from NVIDIA introduced a specialized functional unit, the “tensor core”, that helps meet the growing demand for higher performance for deep learning. In this paper we study the design of the tensor cores in NVIDIA's Volta and Turing architectures. We further propose an architectural model for the tensor cores in Volta. When implemented a GPU simulator, GPGPU-Sim, our tensor core model achieves 99.6% correlation versus an NVIDIA Titan V GPU in terms of average instructions per cycle when running tensor core enabled GEMM workloads. We also describe support added to enable GPGPU-Sim to run CUTLASS, an open-source CUDA C++ template library providing customizable GEMM templates that utilize tensor cores.
Md Aamir Raihan, Negar Goli, Tor M. Aamodt
ISPASS2