David Wadkins

dblp:08/2618 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none

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

Systems, architecture and hardware · 2

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
0.012004
Efficient timing closure without timing driven placement and routing · DAC 2004
Electronic design automation › physical design › placement and routing
timing-driven placement and routing
0.012004
Efficient timing closure without timing driven placement and routing · DAC 2004
Electronic design automation › physical design
timing optimization
0.012004
Efficient timing closure without timing driven placement and routing · DAC 2004

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

transistor sizing · 0.0incremental placement · 0.0clock tree insertion · 0.0
YearPublicationVenuePosition
2006 Post-layout energy-delay analysis of parallel multipliers
abstract
This paper examines parallel multiplier architectures with respect to post-layout energy and delay. Our energy-delay analysis applied to several schemes takes into account the architectural as well as practical circuit implementation issues. Incorporating extracted 3D parasitic loads after layout, our analysis leads to a more realistic conclusion than previous work. A novel parallel-select Booth2 coding method is proposed to improve the performance of the multiplier. Our analysis concludes that the Booth2 method achieves better energy efficiency for large multipliers and for high speed, while the non-Booth method consumes less for small multipliers and longer latencies.
Jinyao Zhang, Miodrag Vujkovic, David Wadkins, Carl Sechen
ISCAS3
2004 Efficient timing closure without timing driven placement and routing
abstract
We have developed a design flow from Verilog/VHDL to layout that mitigates the timing closure problem, while requiring no timing driven placement or routing tools. Timing issues are confined to the cell sizer, allowing the placement algorithm to focus solely on net lengths, resulting in superior layout densities and much lower power. The primary enablers to this new technology are: 1) gridded transistor sizing, 2) variable die routing that allows each net to be routed in the shortest possible length, 3) simultaneous cell placement, routing, gate sizing, and clock tree insertion, and 4) an effective incremental (ECO) placement that preserves net lengths from one iteration to the next. The variable die router is the key enabler. Superior placement and routing densities result from this new variable die approach. In addition, each net is routed at or near minimum length, and thus minor placement changes or cell size changes do not materially impact net lengths.
Miodrag Vujkovic, David Wadkins, William Swartz, Carl Sechen
DAC2