ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow 1 Automatic Die Placement and Flexible I/O Assignment in 2.5D IC Design Daniel P. Seemuth Prof. Azadeh Davoodi.

Slides:



Advertisements
Similar presentations
Constraint Driven I/O Planning and Placement for Chip-package Co-design Jinjun Xiong, Yiuchung Wong, Egino Sarto, Lei He University of California, Los.
Advertisements

Courtesy RK Brayton (UCB) and A Kuehlmann (Cadence) 1 Logic Synthesis Sequential Synthesis.
Neural and Evolutionary Computing - Lecture 4 1 Random Search Algorithms. Simulated Annealing Motivation Simple Random Search Algorithms Simulated Annealing.
1 Advancing Supercomputer Performance Through Interconnection Topology Synthesis Yi Zhu, Michael Taylor, Scott B. Baden and Chung-Kuan Cheng Department.
BSPlace: A BLE Swapping technique for placement Minsik Hong George Hwang Hemayamini Kurra Minjun Seo 1.
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.
3D-STAF: Scalable Temperature and Leakage Aware Floorplanning for Three-Dimensional Integrated Circuits Pingqiang Zhou, Yuchun Ma, Zhouyuan Li, Robert.
Natarajan Viswanathan Min Pan Chris Chu Iowa State University International Symposium on Physical Design April 6, 2005 FastPlace: An Analytical Placer.
Meng-Kai Hsu, Sheng Chou, Tzu-Hen Lin, and Yao-Wen Chang Electronics Engineering, National Taiwan University Routability Driven Analytical Placement for.
A Size Scaling Approach for Mixed-size Placement Kalliopi Tsota, Cheng-Kok Koh, Venkataramanan Balakrishnan School of Electrical and Computer Engineering.
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.
D ISCOVERING REGULATORY AND SIGNALLING CIRCUITS IN MOLECULAR INTERACTION NETWORK Ideker Bioinformatics 2002 Presented by: Omrit Zemach April Seminar.
Paul Falkenstern and Yuan Xie Yao-Wen Chang Yu Wang Three-Dimensional Integrated Circuits (3D IC) Floorplan and Power/Ground Network Co-synthesis ASPDAC’10.
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.
Applying Machine Learning to Circuit Design David Hettlinger Amy Kerr Todd Neller.
FastPlace: Efficient Analytical Placement using Cell Shifting, Iterative Local Refinement and a Hybrid Net Model FastPlace: Efficient Analytical Placement.
A Clustering Utility Based Approach for S. Areibi, M. Thompson, A. Vannelli uoguelph.ca September 2001 School of Engineering ASIC Design 14th.
Computer Science Department Jeff Johns Autonomous Learning Laboratory A Dynamic Mixture Model to Detect Student Motivation and Proficiency Beverly Woolf.
Multiobjective VLSI Cell Placement Using Distributed Simulated Evolution Algorithm Sadiq M. Sait, Mustafa I. Ali, Ali Zaidi.
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
Placement 1 Outline Goal What is Placement? Why Placement?
1 Approximate Solution to an Exam Timetabling Problem Adam White Dept of Computing Science University of Alberta Adam White Dept of Computing Science University.
Reconfigurable Computing (EN2911X, Fall07)
Simulated Annealing 10/7/2005.
Estimation of Wirelength Reduction for λ-Geometry vs. Manhattan Placement and Routing H. Chen, C.-K. Cheng, A.B. Kahng, I. Mandoiu, and Q. Wang UCSD CSE.
EDA (CS286.5b) Day 7 Placement (Simulated Annealing) Assignment #1 due Friday.
MAE 552 – Heuristic Optimization Lecture 10 February 13, 2002.
Planning operation start times for the manufacture of capital products with uncertain processing times and resource constraints D.P. Song, Dr. C.Hicks.
Fuzzy Evolutionary Algorithm for VLSI Placement Sadiq M. SaitHabib YoussefJunaid A. Khan Department of Computer Engineering King Fahd University of Petroleum.
Changbo Long ECE Department, UW-Madison Lei He EDA Research Group EE Department, UCLA Distributed Sleep Transistor Network.
CSE 144 Project Part 2. Overview Multiple rows Routing channel between rows Components of identical height but various width Goal: Implement a placement.
ECE 506 Reconfigurable Computing Lecture 8 FPGA Placement.
CSE 242A Integrated Circuit Layout Automation Lecture 5: Placement Winter 2009 Chung-Kuan Cheng.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Placement by Simulated Annealing. Simulated Annealing  Simulates annealing process for placement  Initial placement −Random positions  Perturb by block.
Confidentiality Preserving Integer Programming for Global Routing Hamid Shojaei, Azadeh Davoodi, Parmesh Ramanathan Department of Electrical and Computer.
Etron Project: Placement and Routing for Chip-Package-Board Co-Design
10/7/ VLSI Physical Design Automation Prof. David Pan Office: ACES Lecture 6. Floorplanning (1)
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.
Solving Hard Instances of FPGA Routing with a Congestion-Optimal Restrained-Norm Path Search Space Keith So School of Computer Science and Engineering.
Lessons Learned The Hard Way: FPGA  PCB Integration Challenges Dave Brady & Bruce Riggins.
March 20, 2007 ISPD An Effective Clustering Algorithm for Mixed-size Placement Jianhua Li, Laleh Behjat, and Jie Huang Jianhua Li, Laleh Behjat,
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig 1 EECS 527 Paper Presentation High-Performance.
New Modeling Techniques for the Global Routing Problem Anthony Vannelli Department of Electrical and Computer Engineering University of Waterloo Waterloo,
Regularity-Constrained Floorplanning for Multi-Core Processors Xi Chen and Jiang Hu (Department of ECE Texas A&M University), Ning Xu (College of CST Wuhan.
Massachusetts Institute of Technology 1 L14 – Physical Design Spring 2007 Ajay Joshi.
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
Ho-Lin Chang, Hsiang-Cheng Lai, Tsu-Yun Hsueh, Wei-Kai Cheng, Mely Chen Chi Department of Information and Computer Engineering, CYCU A 3D IC Designs Partitioning.
Deferred Decision Making Enabled Fixed- Outline Floorplanner Jackey Z. Yan and Chris Chu DAC 2008.
Congestion Estimation and Localization in FPGAs: A Visual Tool for Interconnect Prediction David Yeager Darius Chiu Guy Lemieux The University of British.
Fishbone: A Block-Level Placement and Routing Scheme Fan Mo and Robert K. Brayton EECS, UC Berkeley.
Simultaneous Analog Placement and Routing with Current Flow and Current Density Considerations H.C. Ou, H.C.C. Chien and Y.W. Chang Electronics Engineering,
Routability-driven Floorplanning With Buffer Planning Chiu Wing Sham Evangeline F. Y. Young Department of Computer Science & Engineering The Chinese University.
Outline Problem Definition Related Works & Complexity MILP Formulation Solution Algorithms Computational Experiments Conclusions & Future Research 1/26.
System in Package and Chip-Package-Board Co-Design
An Introduction to Simulated Annealing Kevin Cannons November 24, 2005.
Interconnect Driver Design for Long Wires in FPGAs Edmund Lee University of British Columbia Electrical & Computer Engineering MASc Thesis Presentation.
Effective Linear Programming-Based Placement Techniques Sherief Reda UC San Diego Amit Chowdhary Intel Corporation.
Interconnect Characteristics of 2.5-D System Integration Scheme Yangdong (Steven) Deng & Wojciech P. Maly
Placement and Routing Algorithms. 2 FPGA Placement & Routing.
Unified Adaptivity Optimization of Clock and Logic Signals Shiyan Hu and Jiang Hu Dept of Electrical and Computer Engineering Texas A&M University.
Prediction of Interconnect Net-Degree Distribution Based on Rent’s Rule Tao Wan and Malgorzata Chrzanowska- Jeske Department of Electrical and Computer.
Scientific Research Group in Egypt (SRGE)
Partial Reconfigurable Designs
Heuristic Optimization Methods
HeAP: Heterogeneous Analytical Placement for FPGAs
Sheqin Dong, Song Chen, Xianlong Hong EDA Lab., Tsinghua Univ. Beijing
EE5780 Advanced VLSI Computer-Aided Design
Algorithms for Budget-Constrained Survivable Topology Design
Reconfigurable Computing (EN2911X, Fall07)
Presentation transcript:

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow 1 Automatic Die Placement and Flexible I/O Assignment in 2.5D IC Design Daniel P. Seemuth Prof. Azadeh Davoodi Prof. Katherine Morrow University of Wisconsin – Madison Dept. of Electrical and Computer Engineering

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow 2 Background: 2.5D Integrated Circuits Provides potential to assemble dies from multiple vendors together on a single 2.5D IC

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow 3 Motivation Designing 2.5D embedded systems and integrated circuits is complicated! – Necessitates abstraction and computer-aided design Opportunity: some of the connections between dies may have flexibility in pin assignments – FPGAs with flexible pins – General-purpose I/Os (GPIOs) Flexible interconnect increases design freedom, but also search space – Gives the potential for better solutions – But… need to FIND those solutions!

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow 4 Motivation Challenge: placement and pin assignment decisions are inter-related! Pin assignment affects the best placement Placement affects the best pin assignment

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow 5 2.5D IC Design Automation Goal: allow designer to specify connectivity requirements without limiting flexibility Created a 2.5D IC design framework – Designer specifies design requirements: Component dies Net names, I/O standards, eligible pins – Framework simultaneously performs: Die placement Bank voltage supply assignment Pin assignment Framework takes advantage of flexible interconnect to find improved solutions

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow 6 Simulated Annealing Implementation Simulated annealing (SA): “guided” random movement through solution space – Move (translate) a die – Rotate a die – Swap two dies’ positions – Reassign a net to a different eligible pin Start at “high temperature” – All “good” moves and many “bad” moves accepted Decrease temperature as algorithm progresses – All “good” moves still accepted – Probability of accepting a “bad” move decreases

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow 7 Simulated Annealing Implementation Moves per temperature based on # of dies and # of nets in problem – Automatically tunes simulated annealing based on the problem size Probability of making a die vs. net move based on the proportion of each move type remaining Cooling process: – Based on VPR’s cooling schedule – Fast cooling at extreme temperatures, slower for a good balance of accepted vs. rejected moves Parameter details given in the paper…

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow 8 Simulated Annealing Cost Function Direct costs 1.Average half-perimeter wirelength (HPWL) 2.Maximum HPWL 3.Layout bounding-box area Penalties for hard constraints 4.Dimensions > maximum 5.Die overlap 6.Pins incompatible with power supplies 7.Connection oversubscription Constant weights Weight ↑ as T↓

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow 9 2.5D Placement & Pin Assignment Simulated annealing phase produces: – Position for each die – Voltage for each bank’s power supply – Pins for each connection SA may find pin assignment close to ideal Perform final pin refinement step after SA – Uses ILP formulation to: Minimize total wirelength Meet all physical requirements Meet connectivity requirements – Improved wirelength by small factor

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow 10 Comparison Methodology Compare simultaneous method with sequential method (placement, then pin assignment) Sequential method: – Place dies using simulated annealing Same parameters as simultaneous SA method Use die center as estimated connection endpoint, since pin assignments not yet made – Assign pins using ILP formulation Comparable formulation used for pin refinement for simultaneous method

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow D Results: Placement First Using center of each die to approximate endpoint location leads to inaccurate wirelength estimates

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow D Results: Simultaneous P & PA Wirelength estimates more accurate when based on actual pin assignment Layout improves when pin assignment is updated based on placement and vice-versa

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow D Results Comparison Placement and pin assignment inter-related Improve results with simultaneous placement and pin assignment Placement, then pin assignment HPWL: mm Area: mm 2 Simultaneous placement and pin assignment HPWL: mm (- 51%) Area: mm 2 (+ 2.5%)

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow D Results: Larger System Placement, then pin assignment HPWL: mm Area: mm 2 Simultaneous placement and pin assignment HPWL: mm (- 40%) Area: mm 2 (+ 16%)

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow D Results Summary Simultaneous placement and pin assignments improves layout quality – Significant improvements to HPWL – Small area penalty Avg costs over 10 solutions for each method: SystemMethodTotal HPWL Interposer Area Five-die Sequential2837 mm236.2 mm 2 Simultaneous1530 mm252.6 mm 2 Ring Sequential10435 mm711.2 mm 2 Simultaneous6876 mm804.9 mm 2

ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow 16 Conclusion Proposed method accommodates flexible interconnect in 2.5D IC design automation – Die placement – Bank power supply voltage assignment – Pin and differential pair assignment More effective than separately performing placement followed by pin assignment – Significantly improved wirelength at only a small cost in area