2015-6-11 Layer Assignment Algorithm for RLC Crosstalk Minimization Bin Liu, Yici Cai, Qiang Zhou, Xianlong Hong Tsinghua University.

Slides:



Advertisements
Similar presentations
Caleb Serafy and Ankur Srivastava Dept. ECE, University of Maryland
Advertisements

ECE 667 Synthesis and Verification of Digital Circuits
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
A Graph-Partitioning-Based Approach for Multi-Layer Constrained Via Minimization Yih-Chih Chou and Youn-Long Lin Department of Computer Science, Tsing.
Optimization of Placement Solutions for Routability Wen-Hao Liu, Cheng-Kok Koh, and Yih-Lang Li DAC’13.
An Effective Floorplanning Algorithm in Mixed Mode Placement Integrated with Rectilinear- Shaped Optimization for Soft Blocks Changqi Yang, Xianlong Hong,
Improving Placement under the Constant Delay Model Kolja Sulimma 1, Ingmar Neumann 1, Lukas Van Ginneken 2, Wolfgang Kunz 1 1 EE and IT Department University.
Wen-Hao Liu1, Yih-Lang Li, and Cheng-Kok Koh Department of Computer Science, National Chiao-Tung University School of Electrical and Computer Engineering,
3D-STAF: Scalable Temperature and Leakage Aware Floorplanning for Three-Dimensional Integrated Circuits Pingqiang Zhou, Yuchun Ma, Zhouyuan Li, Robert.
Ripple: An Effective Routability-Driven Placer by Iterative Cell Movement Xu He, Tao Huang, Linfu Xiao, Haitong Tian, Guxin Cui and Evangeline F.Y. Young.
1 Physical Hierarchy Generation with Routing Congestion Control Chin-Chih Chang *, Jason Cong *, Zhigang (David) Pan +, and Xin Yuan * * UCLA Computer.
Coupling-Aware Length-Ratio- Matching Routing for Capacitor Arrays in Analog Integrated Circuits Kuan-Hsien Ho, Hung-Chih Ou, Yao-Wen Chang and Hui-Fang.
PORT: A Price-Oriented Reliable Transport Protocol for Wireless Sensor Networks Yangfan Zhou, Michael. R. Lyu, Jiangchuan Liu † and Hui Wang The Chinese.
Distributed Algorithms for Secure Multipath Routing
MCFRoute: A Detailed Router Based on Multi- Commodity Flow Method Xiaotao Jia, Yici Cai, Qiang Zhou, Gang Chen, Zhuoyuan Li, Zuowei Li.
Multiobjective VLSI Cell Placement Using Distributed Simulated Evolution Algorithm Sadiq M. Sait, Mustafa I. Ali, Ali Zaidi.
Routing 1 Outline –What is Routing? –Why Routing? –Routing Algorithms Overview –Global Routing –Detail Routing –Shortest Path Algorithms Goal –Understand.
Merging Synthesis With Layout For Soc Design -- Research Status Jinian Bian and Hongxi Xue Dept. Of Computer Science and Technology, Tsinghua University,
Processing Rate Optimization by Sequential System Floorplanning Jia Wang 1, Ping-Chih Wu 2, and Hai Zhou 1 1 Electrical Engineering & Computer Science.
ELEN 468 Lecture 271 ELEN 468 Advanced Logic Design Lecture 27 Interconnect Timing Optimization II.
Metal Layer Planning for Silicon Interposers with Consideration of Routability and Manufacturing Cost W. Liu, T. Chien and T. Wang Department of CS, NTHU,
How to Turn on The Coding in MANETs Chris Ng, Minkyu Kim, Muriel Medard, Wonsik Kim, Una-May O’Reilly, Varun Aggarwal, Chang Wook Ahn, Michelle Effros.
Modern VLSI Design 2e: Chapter 4 Copyright  1998 Prentice Hall PTR Topics n Crosstalk. n Power optimization.
RLC Interconnect Modeling and Design Students: Jinjun Xiong, Jun Chen Advisor: Lei He Electrical Engineering Department Design Automation Group (
FBRT: A Feedback-Based Reliable Transport Protocol for Wireless Sensor Networks Yangfan Zhou November, 2004 Supervisors: Dr. Michael Lyu and Dr. Jiangchuan.
1 A Novel Metric for Interconnect Architecture Performance Parthasarathi Dasgupta, Andrew B. Kahng, Swamy V. Muddu Dept. of CSE and ECE University of California,
1 Shortest Path Calculations in Graphs Prof. S. M. Lee Department of Computer Science.
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
Area-I/O Flip-Chip Routing for Chip-Package Co-Design Progress Report 方家偉、張耀文、何冠賢 The Electronic Design Automation Laboratory Graduate Institute of Electronics.
Authors: Jia-Wei Fang,Chin-Hsiung Hsu,and Yao-Wen Chang DAC 2007 speaker: sheng yi An Integer Linear Programming Based Routing Algorithm for Flip-Chip.
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Interconnect design. n Crosstalk. n Power optimization.
1 Coupling Aware Timing Optimization and Antenna Avoidance in Layer Assignment Di Wu, Jiang Hu and Rabi Mahapatra Texas A&M University.
TSV-Aware Analytical Placement for 3D IC Designs Meng-Kai Hsu, Yao-Wen Chang, and Valerity Balabanov GIEE and EE department of NTU DAC 2011.
A Polynomial Time Approximation Scheme For Timing Constrained Minimum Cost Layer Assignment Shiyan Hu*, Zhuo Li**, Charles J. Alpert** *Dept of Electrical.
Wen-Hao Liu 1, Yih-Lang Li 1, and Kai-Yuan Chao 2 1 Department of Computer Science, National Chiao-Tung University, Hsin-Chu, Taiwan 2 Intel Architecture.
March 20, 2007 ISPD An Effective Clustering Algorithm for Mixed-size Placement Jianhua Li, Laleh Behjat, and Jie Huang Jianhua Li, Laleh Behjat,
New Modeling Techniques for the Global Routing Problem Anthony Vannelli Department of Electrical and Computer Engineering University of Waterloo Waterloo,
1 Wire Length Prediction-based Technology Mapping and Fanout Optimization Qinghua Liu Malgorzata Marek-Sadowska VLSI Design Automation Lab UC-Santa Barbara.
Massachusetts Institute of Technology 1 L14 – Physical Design Spring 2007 Ajay Joshi.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Interconnect design. n Crosstalk. n Power optimization.
A Faster Approximation Scheme for Timing Driven Minimum Cost Layer Assignment Shiyan Hu*, Zhuo Li**, and Charles J. Alpert** *Dept of ECE, Michigan Technological.
Register Placement for High- Performance Circuits M. Chiang, T. Okamoto and T. Yoshimura Waseda University, Japan DATE 2009.
Test Architecture Design and Optimization for Three- Dimensional SoCs Li Jiang, Lin Huang and Qiang Xu CUhk Reliable Computing Laboratry Department of.
Clock-Tree Aware Placement Based on Dynamic Clock-Tree Building Yanfeng Wang, Qiang Zhou, Xianlong Hong, and Yici Cai Department of Computer Science and.
ECE 260B – CSE 241A /UCB EECS Kahng/Keutzer/Newton Physical Design Flow Read Netlist Initial Placement Placement Improvement Cost Estimation Routing.
ILP-Based Inter-Die Routing for 3D ICs Chia-Jen Chang, Pao-Jen Huang, Tai-Chen Chen, and Chien-Nan Jimmy Liu Department of Electrical Engineering, National.
Maze Routing Algorithms with Exact Matching Constraints for Analog and Mixed Signal Designs M. M. Ozdal and R. F. Hentschke Intel Corporation ICCAD 2012.
Routability-driven Floorplanning With Buffer Planning Chiu Wing Sham Evangeline F. Y. Young Department of Computer Science & Engineering The Chinese University.
LEMAR: A Novel Length Matching Routing Algorithm for Analog and Mixed Signal Circuits H. Yao, Y. Cai and Q. Gao EDA Lab, Department of CS, Tsinghua University,
Net Criticality Revisited: An Effective Method to Improve Timing in Physical Design H. Chang 1, E. Shragowitz 1, J. Liu 1, H. Youssef 2, B. Lu 3, S. Sutanthavibul.
System in Package and Chip-Package-Board Co-Design
Tunable QoS-Aware Network Survivability Presenter : Yen Fen Kao Advisor : Yeong Sung Lin 2013 Proceedings IEEE INFOCOM.
-1- Delay Uncertainty and Signal Criticality Driven Routing Channel Optimization for Advanced DRAM Products Samyoung Bang #, Kwangsoo Han ‡, Andrew B.
BRAIN TISSUE IMPEDANCE ESTIMATION Improve the Brain’s Evoked Potential’s source Temporal and Spatial Inverse Problem Improve the Brain Tissue Impedance.
A Novel Timing-Driven Global Routing Algorithm Considering Coupling Effects for High Performance Circuit Design Jingyu Xu, Xianlong Hong, Tong Jing, Yici.
Dept. of Electronics Engineering & Institute of Electronics National Chiao Tung University Hsinchu, Taiwan ISPD’16 Generating Routing-Driven Power Distribution.
Worst Case Crosstalk Noise for Nonswitching Victims in High-Speed Buses Jun Chen and Lei He.
Jason Cong, David Zhigang Pan & Prasanna V. Srinivas
2 University of California, Los Angeles
Jinghong Liang,Tong Jing, Xianlong Hong Jinjun Xiong, Lei He
Tong Jing, Ling Zhang, Jinghong Liang
Sheqin Dong, Song Chen, Xianlong Hong EDA Lab., Tsinghua Univ. Beijing
Performance Optimization Global Routing with RLC Crosstalk Constraints
Performance and RLC Crosstalk Driven Global Routing
Chapter 3b Static Noise Analysis
Placement and Routing With Congestion Control
EDA Lab., Tsinghua University
Crosstalk Driven Routing Resource Assignment
Jason Cong, David Zhigang Pan & Prasanna V. Srinivas
Under a Concurrent and Hierarchical Scheme
Presentation transcript:

Layer Assignment Algorithm for RLC Crosstalk Minimization Bin Liu, Yici Cai, Qiang Zhou, Xianlong Hong Tsinghua University

Outline Motivation and Objective Motivation and Objective Crosstalk Cost Estimation Algorithm Description Experimental Results Conclusion

Motivations Crosstalk is becoming a vital factor in high performance designs. Crosstalk consideration in early design stages is necessary. Appropriate method to evaluate the crosstalk cost is needed for early crosstalk avoidance and mitigation.

Motivations Layer assignment is an ideal step to address crosstalk. Global routing: flexible but inaccurate Detailed routing: accurate but lacks flexibility As an intermediate stage, layer assignment combines accuracy and flexibility

Objective Minimize RLC crosstalk risk in layer assignment. Minimize congestion in each layer. Cooperate with further crosstalk mitigation techniques like shield insertion.

Outline Motivation and Objective Crosstalk Cost Estimation Crosstalk Cost Estimation Algorithm Description Experimental Results Conclusion

Noise Budgeting Assumption : Noises on each segment of a wire are independent on each other. Given the noise constraint at a sink, we can distribute the noise onto each segment along the net according to segment length.

Cost Function Basically, on one GRC Edge So the cost of crosstalk on one GRC is

Further Explanation From another perspective: The same noise voltage on longer nets is more dangerous, the severity is proportional to the length Severity is inversely proportional to the constraint So, we use as a weight factor of noise

Noise Calculation Various noise models with different considerations can be used. Capacitive and Inductive Statistically, the noise voltage is approximately proportional to the congestion of sensitive nets

Outline Motivation and Objective Crosstalk Cost Estimation Algorithm Description Algorithm Description Experimental Results Conclusion

Problem Formulation Given: Number of layers The GRC’s that a net passes Noise constraint at each sink Sensitive matrix Routing resources on each layer Output: Layer pair for each net

Problem Formulation Optimize Crosstalk cost Congestion Congestion should be even at each layer Including the shields to be inserted

Algorithm Flow 2-phase Algorithm Initial solution Assign the nets according to the weight Among all possible assignment, the least-cost solution is adopted Optimize using simulated annealing

Algorithm Flow Repeat Ei is the unprocessed GRG-Edge with max W(e) Repeat Nj is the unassigned net on Ei with max W(Nj) For For all layer pairs Assuming Nj is assigned to current layer pair Calculate global cost End for Assign Nj to the layer pair with min global cost Update the congestion of the layer pair Until Until all nets that pass Ei has been assigned Until Until all GRG-Edges has been processed Optimize the solution with simulated annealing Output final solution

Strategies Areas with larger congestion should take priority Nets with higher sensitive rate should take priority Nets with lower noise tolerance should take priority Longer nets should take priority

Outline Motivation and Objective Crosstalk Cost Estimation Algorithm Description Experimental Results Experimental Results Conclusion

Experimental Results Industry instance, IBM benchmark Compared to a previous layer assignment work in ASICON’03 Max coupling length of a net Congestion

Experimental Results max congestion ratio, ours /pre Sens Rate 20%30%40%50% Gdc 0.875/ / / / 0.8 mibm / / / / 0.45 mibm / / / / 0.67 mibm / / / / 0.56 mibm / / / / 0.57 mibm / / / / 0.57 max coupling length, ours/pre Sens Rate 20%30%40%50% Gdc 52/ 99 73/ / / 182 mibm0 1 74/ / / /240 mibm0 2 26/ 48 29/ 67 50/ 95 74/ 118 mibm0 7 32/ 54 62/ 67 78/ / 213 mibm0 8 55/ 79 73/ / / 233 mibm1 0 91/ / / / 340

Outline Motivation and Objective Crosstalk Cost Estimation Algorithm Description Experimental Results Conclusion Conclusion

Conclusion Crosstalk control in layer assignment is necessary and effective. With consideration of net length, we could prevent longer nets suffer too much noise. Successive work could combine layer assignment with track assignment, wire sizing/spacing to achieve better results. This work is on going.

Thanks.