tutorial

ICCAD-2015 CAD Contest in Incremental Timing-driven Placement and Benchmark Suite

Authors:

Myung-Chul Kim,

Natarajan ViswanathanAuthors Info & Claims

ICCAD '15: Proceedings of the IEEE/ACM International Conference on Computer-Aided Design

Pages 921 - 926

Published: 02 November 2015 Publication History

Abstract

At modern technology nodes, improving routability and reducing total wirelength are no longer sufficient to close timing. Incremental timing-driven placement (TDP) seeks to resolve timing violations while limiting the impact to the original placement in an effort to achieve timing closure. To improve the timing landscape in localized regions, some latches or nets may require specialized attention that may not be available in other traditional placement flows (e.g., wirelength-driven). To address this problem, the ICCAD-2015 contest encourages advanced research in incremental timing-driven placement, by providing (i) a flexible timing-oriented placement framework, including a publicly-available and high-quality academic timer, (ii) a set of realistic benchmarks that facilitates academic and commercial collaboration, (iii) an evaluation metric that objectively defines the quality of newly-developed algorithms.

References

[1]

A. I., Abou-Seido, B. Nowak, C. Chu, "Fitted Elmore Delay: A Simple and Accurate Interconnect Delay Model", TVLSI 12(7), 2004, pp. 691--6.

Digital Library

[2]

K. Agarwal et al., "A Simple Metric for Slew Rate of RC Circuits Based on Two Circuit Moments", TCAD 23(9), 2004, pp. 1346--54.

Digital Library

[3]

C. J. Alpert, S. K. Karandikar, Z. Li, G.-J. Nam, S. T. Quay, H. Ren, C. N. Sze, P. Villarrubia, M. C. Yildiz, "Techniques for Fast Physical Synthesis", IEEE 95(3), 2007, pp. 573--599.

[4]

Cadence SOC Encounter User Guide, http://www.cadence.com/products/di/first\_encounter/pages/default.aspx.

[5]

A. E. Caldwell, A. B. Kahng, I. L. Markov. VLSI CAD Bookshelf, http://vlsicad.eecs.umich.edu/BK.

[6]

T.-H. Chao et al., "Zero Skew Clock Routing with Minimum Wire-length", TCAS-II, 1992, pp. 799--814.

[7]

W. Chen, C.-T. Hseih, M. Pedram, "Simultaneous Gate Sizing and Placement", TCAD 19(2), 2000, pp. 206--214.

Digital Library

[8]

W. Choi, K. Bazargan, "Incremental Placement For Timing Optimization", ICCAD, 2003, pp. 463--6.

Digital Library

[9]

A. Chowdhary, K. Rajagopal, S. Venkatesan, T. Cao, V. Tiourin, Y. Perasuram, B. Halpin, "How Accurately Can We Model Timing in a Placement Engine?", DAC, 2005, pp. 801--806.

Digital Library

[10]

C. Chu, Y.-C. Wong, "FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design", TCAD 27(1), 2008, pp. 70--83.

Digital Library

[11]

FreePDK45:Contents, https://www.eda.ncsu.edu/wiki/FreePDK45.

[12]

C. Guth, V. Livramento, R. Netto, R. Fonseca, J. L. Güntzel, L. Santos, "Timing-driven Placement Based on Dynamic Net-weighting for Efficient Slack Histogram Compression", ISPD, 2015, pp. 141--8.

Digital Library

[13]

T.-W. Huang, M. D. F. Wong, OpenTimer, http://web.engr.illinois.edu/~thuang19/software/timer/OpenTimer.html.

[14]

J. Hu, G. Schaeffer, V. Garg, "The TAU 2015 Contest on Incremental Timing and CPPR Analysis", https://sites.google.com/site/tau2015contest.

[15]

A. B. Kahng, H. Lee, J. Li, "Horizontal Benchmark Extension for Improved Assessment of Physical CAD Research", GLSVLSI, 2014, pp. 27--32.

Digital Library

[16]

M.-C. Kim et al., "MAPLE: Multilevel Adaptive PLacement for Mixed-Size Designs", ISPD, 2012, pp. 193--200.

Digital Library

[17]

M.-C. Kim, N. Viswanathan, Z. Li, C. J. Alpert, "ICCAD-2013 CAD Contest in Placement Finishing and Benchmark Suite", ICCAD, pp. 268--270, 2013.

Digital Library

[18]

M.-C. Kim, J. Hu, N. Viswanathan, "The ICCAD-2014 Contest in Incremental Timing-driven Placement and Benchmark Suite", ICCAD, pp. 361--366, 2014.

Digital Library

[19]

M.-C. Kim, J. Hu, "The ICCAD-2015 Contest: Incremental Timing-driven Placement", cad-contest.el.cycu.edu.tw/problem_C/default.html.

[20]

T. Luo et al., "A New LP Based Incremental Timing Driven Placement for High Performance Designs", DAC, 2006, pp. 1115--1120.

Digital Library

[21]

M. D. Moffitt, D. A. Papa, Z. Li, C. J. Alpert, "Path Smoothing via Discrete Optimization", in DAC, 2008, pp. 8--13.

Digital Library

[22]

D. A. Papa et al., "RUMBLE: An Incremental Timing-driven Physical-synthesis Optimization Algorithm", TCAD 27(12), 2008, pp. 2156--68.

Digital Library

[23]

R. Puri, L. Stock, S. Bhattacharya, "Keeping Hot Chips Cool", DAC, 2005, pp. 285--288.

Digital Library

[24]

J. Rabaey, A. Chandrakasan, B. Nikolic, Digital Integrated Circuits: A Design Perspective 2nd Edition, Pearson Education, 2003.

[25]

R. Shelar, "An Efficient Clustering Algorithm for Low Power Clock Tree Synthesis", ISPD, 2007, pp. 181--188.

Digital Library

[26]

UCSD A2A Website, http://vlsicad.ucsd.edu/A2A.

[27]

N. Viswanathan et al., "ITOP: Integrating Timing Optimization Within Placement", ISPD, 2010, pp. 83--90.

Digital Library

[28]

N. Viswanathan et al., "ICCAD-2012 CAD Contest in Design Hierarchy aware Routability-driven Placement and Benchmark Suite", ICCAD, 2012. pp. 345--348.

Digital Library

[29]

Q. B. Wang, J. Lillis, S. Sanyal, "An LP-based Methodology for Improved Timing-driven Placement", ASPDAC, 2005, pp. 18--21.

Digital Library

Cited By

Chen YWu HJiang ITsai CWu CHui-Ru Jiang IPosser G(2024)Slack Redistributed Register Clustering with Mixed-Driving Strength Multi-bit Flip-FlopsProceedings of the 2024 International Symposium on Physical Design10.1145/3626184.3633327(21-29)Online publication date: 12-Mar-2024
https://dl.acm.org/doi/10.1145/3626184.3633327
Chang YLin TJiang INam GBustany ISwartz W(2019)Graceful Register Clustering by Effective Mean Shift Algorithm for Power and Timing BalancingProceedings of the 2019 International Symposium on Physical Design10.1145/3299902.3309753(11-18)Online publication date: 4-Apr-2019
https://dl.acm.org/doi/10.1145/3299902.3309753
Liu YChen TChang YKuo SShibuya T(2019)MDP-treesProceedings of the 24th Asia and South Pacific Design Automation Conference10.1145/3287624.3287677(557-562)Online publication date: 21-Jan-2019
https://dl.acm.org/doi/10.1145/3287624.3287677
Show More Cited By

Index Terms

ICCAD-2015 CAD Contest in Incremental Timing-driven Placement and Benchmark Suite
1. Applied computing
  1. Arts and humanities
    1. Architecture (buildings)
      1. Computer-aided design
  2. Physical sciences and engineering
    1. Engineering
      1. Computer-aided design
2. Hardware
  1. Hardware validation

Recommendations

The ISPD2005 placement contest and benchmark suite
ISPD '05: Proceedings of the 2005 international symposium on Physical design

Without the MCNC and ISPD98 benchmarks, it would arguably not have been possible for the academic community to make consistent advances in physical design over the last decade. While still being used extensively in placement and floorplanning research, ...
ICCAD-2013 CAD contest in placement finishing and benchmark suite
ICCAD '13: Proceedings of the International Conference on Computer-Aided Design

At advanced technology nodes, highly-optimized placements need careful post-processing to further reduce interconnect length or optimize resource distribution, and therefore, high-performance legalization and detailed placement steps are essential for ...
ICCAD-2014 CAD contest in incremental timing-driven placement and benchmark suite
ICCAD '14: Proceedings of the 2014 IEEE/ACM International Conference on Computer-Aided Design

Circuit performance is greatly affected by the quality and optimization metrics of placement algorithms. At modern technology nodes, improving routability and reducing total wirelength are no longer sufficient to close timing, as nets may require ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICCAD '15: Proceedings of the IEEE/ACM International Conference on Computer-Aided Design

November 2015

955 pages

ISBN:9781467383899

General Chair:
Diana Marculescu
Carnegie Mellon Univ., Dept. of Electrical and Computer Engineering, 5000 Forbes Ave., Pittsburgh, PA 15213, 412-268-1167
,
Program Chair:
Frank Liu
IBM Corp., IBM Austin Research Lab, 11501 Burnet Rd., MS 904-6G017, Austin, TX 78758, 512-286-7267

Sponsors

SIGDA: ACM Special Interest Group on Design Automation

Publisher

IEEE Press

Publication History

Published: 02 November 2015

Check for updates

Qualifiers

Tutorial
Research
Refereed limited

Conference

ICCAD '15

Sponsor:

SIGDA

ICCAD '15: IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN

November 2 - 6, 2015

TX, Austin, USA

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
243
Total Downloads

Downloads (Last 12 months)29
Downloads (Last 6 weeks)7

Reflects downloads up to 24 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chen YWu HJiang ITsai CWu CHui-Ru Jiang IPosser G(2024)Slack Redistributed Register Clustering with Mixed-Driving Strength Multi-bit Flip-FlopsProceedings of the 2024 International Symposium on Physical Design10.1145/3626184.3633327(21-29)Online publication date: 12-Mar-2024
https://dl.acm.org/doi/10.1145/3626184.3633327
Chang YLin TJiang INam GBustany ISwartz W(2019)Graceful Register Clustering by Effective Mean Shift Algorithm for Power and Timing BalancingProceedings of the 2019 International Symposium on Physical Design10.1145/3299902.3309753(11-18)Online publication date: 4-Apr-2019
https://dl.acm.org/doi/10.1145/3299902.3309753
Liu YChen TChang YKuo SShibuya T(2019)MDP-treesProceedings of the 24th Asia and South Pacific Design Automation Conference10.1145/3287624.3287677(557-562)Online publication date: 21-Jan-2019
https://dl.acm.org/doi/10.1145/3287624.3287677
Tu PPui CYoung EChen DHomayoun HTaskin B(2018)Simultaneous Timing Driven Tree Surgery in Routing with Machine Learning-based AccelerationProceedings of the 2018 Great Lakes Symposium on VLSI10.1145/3194554.3194556(261-266)Online publication date: 30-May-2018
https://dl.acm.org/doi/10.1145/3194554.3194556
Jung JNam GReddy LJiang IShin Y(2018)OWARUIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2017.277427737:9(1825-1838)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1109/TCAD.2017.2774277
Chen GTu PYoung EParameswaran S(2017)SALTProceedings of the 36th International Conference on Computer-Aided Design10.5555/3199700.3199776(569-576)Online publication date: 13-Nov-2017
https://dl.acm.org/doi/10.5555/3199700.3199776
Fontana TAlmeida SNetto RLivramento VGuth CPilla LGüntzel JSilveira J(2017)Exploiting cache locality to speedup register clusteringProceedings of the 30th Symposium on Integrated Circuits and Systems Design: Chip on the Sands10.1145/3109984.3110005(191-197)Online publication date: 28-Aug-2017
https://dl.acm.org/doi/10.1145/3109984.3110005
Kim SDo SKang S(2017)Fast Predictive Useful Skew Methodology for Timing-Driven Placement OptimizationProceedings of the 54th Annual Design Automation Conference 201710.1145/3061639.3062247(1-6)Online publication date: 18-Jun-2017
https://dl.acm.org/doi/10.1145/3061639.3062247
Netto RLivramento VGuth Cdos Santos LGüntzel Jde Lima Monteiro DTorres FIndrusiak L(2016)Evaluating the impact of circuit legalization on incremental optimization techniquesProceedings of the 29th Symposium on Integrated Circuits and Systems Design: Chip on the Mountains10.5555/3145862.3145867(1-6)Online publication date: 29-Aug-2016
https://dl.acm.org/doi/10.5555/3145862.3145867
Huang CLiu YLu YKuo YChang YKuo S(2016)Timing-driven cell placement optimization for early slack histogram compressionProceedings of the 53rd Annual Design Automation Conference10.1145/2897937.2898105(1-6)Online publication date: 5-Jun-2016
https://dl.acm.org/doi/10.1145/2897937.2898105
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten