buffered steiner trees for difficult instances l.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Buffered Steiner Trees for Difficult Instances PowerPoint Presentation
Download Presentation
Buffered Steiner Trees for Difficult Instances

Loading in 2 Seconds...

play fullscreen
1 / 18

Buffered Steiner Trees for Difficult Instances - PowerPoint PPT Presentation


  • 311 Views
  • Uploaded on

Buffered Steiner Trees for Difficult Instances Charles J. Alpert, Gopal Gandham, Milos Hrkic, John Lillis, Jiang Hu, Andrew B. Kahng, Bao Liu, Stephen T. Quay, Sachin S. Sapatnekar, Andrew J. Sullivan Late 1980s Min-Cost Steiner Tree Timing-driven Steiner Tree Early 1990s

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Buffered Steiner Trees for Difficult Instances' - Mercy


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
buffered steiner trees for difficult instances

Buffered Steiner Trees for Difficult Instances

Charles J. Alpert, Gopal Gandham, Milos Hrkic, John Lillis, Jiang Hu, Andrew B. Kahng, Bao Liu, Stephen T. Quay, Sachin S. Sapatnekar, Andrew J. Sullivan

ripping out synthesis trees
Ripping out Synthesis Trees
  • Ugly pre-PD buffered trees
  • Inverted sinks
  • Trivial van Ginneken/Lillis change
    • Normal sinks: one positive candidate
    • Inverted sinks: one negative candidate
  • No big deal
or is it

+

+

+

+

_

_

_

_

_

_

_

Or Is It?
the texas two step

Unrouted net

with placed pins

Construct

Steiner

Tree

Simultaneous

Tree Construction

And Buffer

Insertion

Dynamic

Programming

Buffer

Insertion

Buffered

Steiner

Tree

The Texas Two Step

Optimal

c tree algorithm
C-Tree Algorithm
  • A-, B-, H-, O-, P-, trees taken
  • Cluster sinks by
    • Polarity
    • Manhattan distance
    • Criticality
  • Two-level tree
    • Form tree for each cluster
    • Form top-level tree
slide15

Flat

C-Tree

difficult steiner instances
Difficult Steiner Instances
  • Polarity/size makes it hard
  • 3d trade-off
    • Timing
    • Buffers
    • Wire length
  • Work on it!