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

Subramanyam Sripada

dblp:36/370 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none

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

Systems, architecture and hardware · 2 · 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
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
timing analysis
0.322015
A timing graph based approach to mode merging · DAC 2015
Automated timing model generation · DAC 2002
Electronic design automation › hardware verification and test
hardware verification
0.112015
A timing graph based approach to mode merging · DAC 2015
Electronic design automation › hardware verification and test
timing verification
0.112015
A timing graph based approach to mode merging · DAC 2015
Electronic design automation
design flow
0.012002
Automated timing model generation · DAC 2002
Electronic design automation › design methodology
hierarchical design
0.012002
Automated timing model generation · DAC 2002
Electronic design automation › system-level design
IP reuse
0.012002
Automated timing model generation · DAC 2002
Electronic design automation
timing model generation
0.012002
Automated timing model generation · DAC 2002

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

timing graph analysis · 0.2static timing analysis · 0.0
YearPublicationVenuePosition
2015 A timing graph based approach to mode merging
abstract
With shrinking technologies and increasing design complexities, it is common to have a large number of modes (functional, scan, test and so on) and corners (PVT device and interconnect). This leads to an explosion in the number of scenarios (#modes × #corners) that need to be validated for timing. While multiple tactics are required to handle this problem, one essential way to address this is by reducing the number of modes by merging individual modes into superset modes. However, with the overriding necessity to maintain sign-off accuracy, mode merging with high merge-factor is very complex. In this paper, we propose a novel automated timing graph based approach to mode merging that is designed to meet these requirements. By construction, there is an inbuilt validation that the merged constraints correctly model the intent of original constraints. This technology is tested on large industrial designs and the results are provided.
Subramanyam Sripada, Murthy Palla
DAC1
2002 Automated timing model generation
abstract
The automated generation of timing models from gate-level netlists facilitates IP reuse and dramatically improves chip-level STA runtime in a hierarchical design flow. In this paper we discuss two different approaches to model generation, the design flows they lend themselves to and results from the application of these model generation solutions to large customer designs.
Ajay J. Daga, Loa Mize, Subramanyam Sripada, Chris Wolff, Qiuyang Wu
DAC3