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

Akshay Sridharan

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

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

Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
1 paper
Electronic design automation · 70% Energy-efficient computing · 23% GPUs and heterogeneous computing · 7%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test › logic simulation
gate-level simulation
0.612022
GATSPI: GPU accelerated gate-level simulation for power improvement · DAC 2022
Energy-efficient computing › dynamic power reduction
glitch reduction
0.612022
GATSPI: GPU accelerated gate-level simulation for power improvement · DAC 2022
Electronic design automation › hardware verification and test
logic simulation
0.612022
GATSPI: GPU accelerated gate-level simulation for power improvement · DAC 2022
Electronic design automation
power estimation
0.612022
GATSPI: GPU accelerated gate-level simulation for power improvement · DAC 2022
GPUs and heterogeneous computing › GPU-accelerated scientific computing
GPU-accelerated simulation
0.212022
GATSPI: GPU accelerated gate-level simulation for power improvement · DAC 2022

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

pytorch · 0.6CUDA · 0.6
YearPublicationVenuePosition
2022 GATSPI: GPU accelerated gate-level simulation for power improvement
abstract
In this paper, we present GATSPI, a novel GPU accelerated logic gate simulator that enables ultra-fast power estimation for industry-sized ASIC designs with millions of gates. GATSPI is written in PyTorch with custom CUDA kernels for ease of coding and maintainability. It achieves simulation kernel speedup of up to 1668X on a single-GPU system and up to 7412X on a multiple-GPU system when compared to a commercial gate-level simulator running on a single CPU core. GATSPI supports a range of simple to complex cell types from an industry standard cell library and SDF conditional delay statements without requiring prior calibration runs and produces industry-standard SAIF files from delay-aware gate-level simulation. Finally, we deploy GATSPI in a glitch-optimization flow, achieving a 1.4% power saving with a 449X speedup in turnaround time compared to a similar flow using a commercial simulator.
Yanqing Zhang 0002, Haoxing Ren, Akshay Sridharan, Brucek Khailany
DAC3
2013 Low-voltage low-overhead asynchronous logic
abstract
A new delay-bounded asynchronous logic technique aimed at maximizing reliability at very low voltages is proposed. Compared to previous asynchronous logic approaches, the area and nominal delay overheads are small. Conventional standard cell libraries and conventional logic synthesis tools are used. The bounding delay elements used by the asynchronous controller feature programmable delays that are initially set based on static timing analysis. However, the delay elements are updated on-the-fly during actual operation of the circuit, resulting in strong resiliency even at low voltages and with extreme variations. Several benchmark circuits were implemented with the new asynchronous design flow using the 45nm TI process. Monte Carlo analysis demonstrates the expected resiliency. Compared to the equivalent synchronous circuits, the asynchronous versions have area overheads averaging 40%, although much smaller for large circuits. Nominal delay overheads average about 10%.
Akshay Sridharan, Carl Sechen, Roozbeh Jafari
ISLPED1