1 / 24

Yen-Hung Lin, Shu-Hsin Chang, Yih Lang Li ISPD 2009

Critical-Trunk Based Obstacle-Avoiding Rectilinear Steiner Tree Routings for Delay and Slack Optimization. Yen-Hung Lin, Shu-Hsin Chang, Yih Lang Li ISPD 2009. PRELIMINARIES. Maze-routing based (Wave propagation) Execution time Memory requirements Spanning graph-based (OARSMT)

dori
Download Presentation

Yen-Hung Lin, Shu-Hsin Chang, Yih Lang Li ISPD 2009

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Critical-Trunk Based Obstacle-Avoiding Rectilinear Steiner Tree Routings for Delay and Slack Optimization Yen-Hung Lin, Shu-Hsin Chang, Yih Lang Li ISPD 2009

  2. PRELIMINARIES • Maze-routing based (Wave propagation) • Execution time • Memory requirements • Spanning graph-based (OARSMT) • Shen et al. [9] • Lin et al. [10] • Long et al. [11]

  3. MOTIVATION • Studies of performance-driven Steiner trees have demonstrated that minimization of wirelength may worsen the performance of the Steiner tree

  4. CONTRIBUTION • First work to construct OARST while considering the Elmore delay • A critical-trunk-based tree growth mechanism

  5. OUTLINE • PROBLEM FORMULATION • CRITICAL TRUNK • PDOARST • SDOARST • EXPERIMENTAL RESULT • CONCLUSION

  6. PROBLEM FORMULATION • PDOARST (Performance-Driven Obstacle-Avoiding Rectilinear Steiner Tree) • Given • P, B, T • Find • Min max{di} • SDOARST (Slack-Driven Obstacle-Avoiding Rectilinear Steiner Tree) • Given • P, B, T • Find • Max WNS (Worst Negative Slack)

  7. RELATION BETWEEN RADIUS AND CIRCUIT DELAY

  8. CRITICAL TRUNK

  9. PDOARST

  10. PDCT • PDCTF • Performance-Driven Criticality Threshold Factor • PDCR • Performance-Driven Critical Radius • PDCS • Performance-Driven Critical Sink • PDCT • Performance-Driven Critical Trunk

  11. MULTI-SOURCE SINGLE-TARGET MAZE ROUTING

  12. A* SEARCH ALGORITHM

  13. PDCT ALGO.

  14. PDSubtree

  15. PDSubtree

  16. RECTILINEARIZATION

  17. PD V.S. SD

  18. SDOARST

  19. SDCT

  20. REDIRECTION

  21. EXPERIMENTAL RESULT

  22. EXPERIMENTAL RESULT

  23. EXPERIMENTAL RESULT

  24. CONCLUSION • This work proposes a critical-trunk-based tree growth mechanism • OARST with different objective • Minimization of maximum delay • Maximization of the worst negative slack

More Related