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

Vaibhav Verma

dblp:141/0589 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · conflict

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

Systems, architecture and hardware · 3 · 1 since 2021

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
Memory systems · 42% Reconfigurable computing and FPGAs · 25% Energy-efficient computing · 17%

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

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
FPGA routing architecture
0.412019
eAP: A Scalable and Efficient In-Memory Accelerator for Automata Processing · MICRO 2019
Memory systems › in-memory computing
in-memory automata accelerator
0.412019
eAP: A Scalable and Efficient In-Memory Accelerator for Automata Processing · MICRO 2019
Energy-efficient computing › voltage scaling
near-threshold computing
0.312018
SRAM based opportunistic energy efficiency improvement in dual-supply near-threshold processors · DAC 2018
Hardware reliability and fault tolerance
reliability analysis
0.312018
SRAM based opportunistic energy efficiency improvement in dual-supply near-threshold processors · DAC 2018
Memory systems › random-access memory
SRAM
0.312018
SRAM based opportunistic energy efficiency improvement in dual-supply near-threshold processors · DAC 2018
Reconfigurable computing and FPGAs
automata processing
0.112019
eAP: A Scalable and Efficient In-Memory Accelerator for Automata Processing · MICRO 2019
Memory systems
processing-in-memory
0.112019
eAP: A Scalable and Efficient In-Memory Accelerator for Automata Processing · MICRO 2019

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

place and route · 0.4finite automata · 0.4write aggregation · 0.3voltage boosting · 0.3
YearPublicationVenuePosition
2023 Design Space Exploration of Layer-Wise Mixed-Precision Quantization with Tightly Integrated Edge Inference Units
abstract
Layer-wise mixed-precision quantization (MPQ) has become prevailing for edge inference since it strikes a better balance between accuracy and efficiency compared to the uniform quantization scheme. Existing MPQ strategies either lacked hardware awareness or incurred huge computation costs, which gated their deployment at the edge. In this work, we propose a novel MPQ search algorithm that obtains an optimal scheme by "sampling" layer-wise sensitivity with respect to a newly proposed metric that incorporates both accuracy and proxy of hardware cost. To further efficiently deploy post-training MPQ on edge chips, we propose to tightly integrate the quantized inference units as part of the processor pipeline through micro-architecture and Instruction Set Architecture (ISA) co-design. Evaluation results show that the proposed search algorithm achieves 3% ~ 11% higher inference accuracy with similar hardware cost compared to the state-of-the-art MPQ strategies. In addition, the tightly integrated MPQ units achieve speedup of 15.13x ~ 29.65x compared to a baseline RISC-V processor.
Xiaotian Zhao, Yimin Gao, Vaibhav Verma, Ruge Xu, Mircea R. Stan, Xinfei Guo
ACM Great Lakes Symposium on VLSI3
2019 eAP: A Scalable and Efficient In-Memory Accelerator for Automata Processing
abstract
Accelerating finite automata processing benefits regular-expression workloads and a wide range of other applications that do not map obviously to regular expressions, including pattern mining, bioinformatics, and machine learning. Existing in-memory automata processing accelerators suffer from inefficient routing architectures. They are either incapable of efficiently place-and-route a highly connected automaton or require an excessive amount of hardware resources.
Elaheh Sadredini, Reza Rahimi, Vaibhav Verma, Mircea R. Stan, Kevin Skadron
MICRO3
2018 SRAM based opportunistic energy efficiency improvement in dual-supply near-threshold processors
abstract
Energy-efficient microprocessors are essential for a wide range of applications. While near-threshold computing is a promising technique to improve energy efficiency, optimal supply demands from logic core and on-chip memory are conflicting. In this paper, we perform reliability analysis of 6T SRAM and discover imbalanced minimum voltage requirements between read and write operations. We leverage this imbalance property in near-threshold processors equipped with voltage boosting capability by proposing an opportunistic dual-supply switching scheme with a write aggregation buffer. Our results show that proposed technique improves energy efficiency by more than 18% with approximate 8.54% performance speed-up.
Yunfei Gu, Dengxue Yan, Vaibhav Verma, Mircea R. Stan, Xuan Zhang 0001
DAC3