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

Vidyamani Parkhe

dblp:127/9054 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2014
—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
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design
buffer insertion
0.212014
On Timing Closure: Buffer Insertion for Hold-Violation Removal · DAC 2014
Electronic design automation
physical design
0.212014
On Timing Closure: Buffer Insertion for Hold-Violation Removal · DAC 2014
Electronic design automation › physical design
timing optimization
0.212014
On Timing Closure: Buffer Insertion for Hold-Violation Removal · DAC 2014

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

linear programming · 0.2
YearPublicationVenuePosition
2014 On Timing Closure: Buffer Insertion for Hold-Violation Removal
abstract
Timing closure, which is to meet the design's timing constraints, is a key problem in the physical design flow. During the timing optimization process, buffers can be used to speedup the circuit or serve as delay elements. In this paper, we study the hold-violation removal problem for today's industrial designs. Discrete buffers, accurate timing models/analysis, and complex timing constraints make the problem difficult and time-consuming to solve. In this paper, we first present a linear programming-based methodology to model the setup and hold-time constraints. Then based on the solution to the linear programming, buffers are inserted as delay elements to solve hold violations. In the experiment, our approach is tested on industrial designs, then runs with the industrial optimization flow, and better results in terms of hold violations and runtime are reported.
Pei-Ci Wu, Martin D. F. Wong, Ivailo Nedelchev, Sarvesh Bhardwaj, Vidyamani Parkhe
DAC5
2013 Variability aware hierarchical implementation of big chips
abstract
Over the last decade, transistor dimensions have shrunk rapidly by a factor of ten, while chip sizes have increased many folds and so have the scenarios in which they are expected to function. Silo technology development of yester years has all but disappeared as clear boundaries between various stages of the flow evaporate--need for resynthesis can be felt as late as post routing and necessity for understanding signal integrity and manufacturing as early as pre-placement. This leads designers to explore newer techniques to meet their power and performance targets and EDA vendors to retool and reinvent algorithms for sub teen nanometer technologies.
Vidyamani Parkhe
ISPD1