Improving Voltage Assignment by Outlier Detection and Incremental Placement Huaizhi Wu* and Martin D.F. Wong** * Atoptech, Inc. ** University of Illinois.

Slides:



Advertisements
Similar presentations
ECE 667 Synthesis and Verification of Digital Circuits
Advertisements

OCV-Aware Top-Level Clock Tree Optimization
Ispd-2007 Repeater Insertion for Concurrent Setup and Hold Time Violations with Power-Delay Trade-Off Salim Chowdhury John Lillis Sun Microsystems University.
Transportation Problem (TP) and Assignment Problem (AP)
Introduction to Algorithms
June 6, Using Negative Edge Triggered FFs to Reduce Glitching Power in FPGA Circuits Tomasz S. Czajkowski and Stephen D. Brown Department of Electrical.
© KLMH Lienig Paper: A Unified Theory of Timing Budget Management Presented by: Hangcheng Lou Original Authors: Soheil Ghiasi, Elaheh Bozorgzadeh, Siddharth.
ENGM 732 Formalization of Network Flows Network Flow Models.
Reap What You Sow: Spare Cells for Post-Silicon Metal Fix Kai-hui Chang, Igor L. Markov and Valeria Bertacco ISPD’08, Pages
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.
Post-Placement Voltage Island Generation for Timing-Speculative Circuits Rong Ye†, Feng Yuan†, Zelong Sun†, Wen-Ben Jone§ and Qiang Xu†‡
The Out of Kilter Algorithm in Introduction The out of kilter algorithm is an example of a primal-dual algorithm. It works on both the primal.
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
NTHU-CS 1 Performance-Optimal Clustering with Retiming for Sequential Circuits Tzu-Chieh Tien and Youn-Long Lin Department of Computer Science National.
Fuzzy Simulated Evolution for Power and Performance of VLSI Placement Sadiq M. Sait Habib Youssef Junaid A. KhanAimane El-Maleh Department of Computer.
Boosting: Min-Cut Placement with Improved Signal Delay Andrew B. KahngSherief Reda CSE & ECE Departments University of CA, San Diego La Jolla, CA
38 th Design Automation Conference, Las Vegas, June 19, 2001 Creating and Exploiting Flexibility in Steiner Trees Elaheh Bozorgzadeh, Ryan Kastner, Majid.
Subthreshold Logic Energy Minimization with Application- Driven Performance EE241 Final Project Will Biederman Dan Yeager.
A Timing-Driven Soft-Macro Resynthesis Method in Interaction with Chip Floorplanning Hsiao-Pin Su 1 2 Allen C.-H. Wu 1 Youn-Long Lin 1 1 Department of.
Threshold Voltage Assignment to Supply Voltage Islands in Core- based System-on-a-Chip Designs Milestone 1: Gall Gotfried Steven Beigelmacher
Generating Supply Voltage Islands In Core-based System-on-Chip Designs Final Presentation Steven Beigelmacher Gall Gotfried 04/26/2005.
Fuzzy Simulated Evolution for Power and Performance of VLSI Placement Sadiq M. SaitHabib Youssef Junaid A. KhanAimane El-Maleh Department of Computer Engineering.
Facility Location Set of facilities F Set of clients D Facility Opening cost f i Connection cost of facility i to client j c ij Goal: Open a collection.
An Efficient Chiplevel Time Slack Allocation Algorithm for Dual-Vdd FPGA Power Reduction Yan Lin 1, Yu Hu 1, Lei He 1 and Vijay Raghunathan 2 1 EE Department,
Processing Rate Optimization by Sequential System Floorplanning Jia Wang 1, Ping-Chih Wu 2, and Hai Zhou 1 1 Electrical Engineering & Computer Science.
Layout-based Logic Decomposition for Timing Optimization Yun-Yin Lien* Youn-Long Lin Department of Computer Science, National Tsing Hua University, Hsin-Chu,
Leakage Efficient Chip-Level Dual-Vdd Assignment with Time Slack Allocation for FPGA Power Reduction Yan Lin and Lei He EE Department, UCLA Partially supported.
Pei-Ci Wu Martin D. F. Wong On Timing Closure: Buffer Insertion for Hold-Violation Removal DAC’14.
Metal Layer Planning for Silicon Interposers with Consideration of Routability and Manufacturing Cost W. Liu, T. Chien and T. Wang Department of CS, NTHU,
1 Reconfigurable ECO Cells for Timing Closure and IR Drop Minimization TingTing Hwang Tsing Hua University, Hsin-Chu.
Decoupling Capacitance Allocation for Power Supply Noise Suppression Shiyou Zhao, Kaushik Roy, Cheng-Kok Koh School of Electrical & Computer Engineering.
ECE 506 Reconfigurable Computing Lecture 8 FPGA Placement.
PLACEMENT USING DON’T CARE WIRES Fan Mo Don’t Care Wire Group: P.Chong, Y-J.Jiang, S.Singha and R.K.Brayton.
MGR: Multi-Level Global Router Yue Xu and Chris Chu Department of Electrical and Computer Engineering Iowa State University ICCAD
Primal-Dual Meets Local Search: Approximating MST’s with Non-uniform Degree Bounds Author: Jochen Könemann R. Ravi From CMU CS 3150 Presentation by Dan.
A New Methodology for Reduced Cost of Resilience Andrew B. Kahng, Seokhyeong Kang and Jiajia Li UC San Diego VLSI CAD Laboratory.
Power Reduction for FPGA using Multiple Vdd/Vth
1 Coupling Aware Timing Optimization and Antenna Avoidance in Layer Assignment Di Wu, Jiang Hu and Rabi Mahapatra Texas A&M University.
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.
Low-Power Gated Bus Synthesis for 3D IC via Rectilinear Shortest-Path Steiner Graph Chung-Kuan Cheng, Peng Du, Andrew B. Kahng, and Shih-Hung Weng UC San.
BSG-Route: A Length-Matching Router for General Topology T. Yan and M. D. F. Wong University of Illinois at Urbana-Champaign ICCAD 2008.
A NEW ECO TECHNOLOGY FOR FUNCTIONAL CHANGES AND REMOVING TIMING VIOLATIONS Jui-Hung Hung, Yao-Kai Yeh,Yung-Sheng Tseng and Tsai-Ming Hsieh Dept. of Information.
-1- UC San Diego / VLSI CAD Laboratory Construction of Realistic Gate Sizing Benchmarks With Known Optimal Solutions Andrew B. Kahng, Seokhyeong Kang VLSI.
Kwangsoo Han, Andrew B. Kahng, Hyein Lee and Lutong Wang
AUTOMATIC BUS PLANNER FOR DENSE PCBS Hui Kong, Tan Yan and Martin D.F. Wong Department of Electrical and Computer Engineering, University of Illinois at.
The minimum cost flow problem. Simplifying assumptions Network is connected (as an undirected graph). – We can consider each connected component separately.
ECO Timing Optimization Using Spare Cells Yen-Pin Chen, Jia-Wei Fang, and Yao-Wen Chang ICCAD2007, Pages ICCAD2007, Pages
I N V E N T I V EI N V E N T I V E A Morphing Approach To Address Placement Stability Philip Chong Christian Szegedy.
1 Combinatorial Algorithms Local Search. A local search algorithm starts with an arbitrary feasible solution to the problem, and then check if some small,
Self-Aligned Double Patterning Decomposition for Overlay Minimization and Hot Spot Detection H. Zhang, Y. Du, M. D.F. Wong, R. Topaloglu Dept. of ECE,
Clock-Tree Aware Placement Based on Dynamic Clock-Tree Building Yanfeng Wang, Qiang Zhou, Xianlong Hong, and Yici Cai Department of Computer Science and.
1 A Min-Cost Flow Based Detailed Router for FPGAs Seokjin Lee *, Yongseok Cheon *, D. F. Wong + * The University of Texas at Austin + University of Illinois.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
Post-Layout Leakage Power Minimization Based on Distributed Sleep Transistor Insertion Pietro Babighian, Luca Benini, Alberto Macii, Enrico Macii ISLPED’04.
1 EL736 Communications Networks II: Design and Algorithms Class7: Location and Topological Design Yong Liu 10/24/2007.
March 28, Glitch Reduction for Altera Stratix II devices Tomasz S. Czajkowski PhD Candidate University of Toronto Supervisor: Professor Stephen D.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
12 Sep 03Martin Pál: Cost sharing & Approx1 Cost Sharing and Approximation Martin Pál joint work with Éva Tardos A-exam.
Effective Linear Programming-Based Placement Techniques Sherief Reda UC San Diego Amit Chowdhary Intel Corporation.
The minimum cost flow problem. Solving the minimum cost flow problem.
PRIMAL-DUAL APPROXIMATION ALGORITHMS FOR METRIC FACILITY LOCATION AND K-MEDIAN PROBLEMS K. Jain V. Vazirani Journal of the ACM, 2001.
Approximation Algorithms Duality My T. UF.
Clustering Data Streams A presentation by George Toderici.
Proximity Optimization for Adaptive Circuit Design Ang Lu, Hao He, and Jiang Hu.
Placement and Routing Algorithms. 2 FPGA Placement & Routing.
On-Chip Power Network Optimization with Decoupling Capacitors and Controlled-ESRs Wanping Zhang1,2, Ling Zhang2, Amirali Shayan2, Wenjian Yu3, Xiang Hu2,
The minimum cost flow problem
Iterative Deletion Routing Algorithm
Chapter 3b Leakage Efficient Chip-Level Dual-Vdd Assignment with Time Slack Allocation for FPGA Power Reduction Prof. Lei He Electrical Engineering Department.
Presentation transcript:

Improving Voltage Assignment by Outlier Detection and Incremental Placement Huaizhi Wu* and Martin D.F. Wong** * Atoptech, Inc. ** University of Illinois at Urbana-Champaign DAC 2007

Outline Introduction Motivation Outlier Detection Incremental Placement Experimental Results Conclusions

Outline Introduction Motivation Outlier Detection Incremental Placement Experimental Results Conclusions

Introduction Multi-Supply Voltage (MSV) Higher voltage on critical paths for performance Lower voltage on other paths for power saving Complex power supply system Higher design cost Level shifters need to be inserted between low- Vdd and high-Vdd cells Grouping cells into Voltage Islands Each Voltage Island has a single supply voltage

Design Flow

Outline Introduction Motivation Outlier Detection Incremental Placement Experimental Results Conclusions

Motivation Outliers The few distant high voltage cells Cause disproportinately expensive penalty to the final Voltage Island grouping w/ outliersw/o outliers outliers

Modified Design Flow

Outline Introduction Motivation Outlier Detection Incremental Placement Experimental Results Conclusions

Uncapacitated Facility Location Problem c 10,8 f8f8 LP-relaxation Dual program

Primal-Dual Schema Start with (at time 0) primal solution x, y=0: no facilities open, no clients connected dual solution α, β=0: zero budget for each client Iteration Uniformly increase budgets (α j ) of clients Allocate the budgets towards facility opening costs and connection costs

Primal-Dual Schema (Cont.) for unconnected client j and unpaid for facility i Client j starts paying facility i  β ij starts growing for facility i Facility i is paid for Each unconnected client j paying facility i is connected, and client j stops paying any facility for unconnected client j and paid for facility i Client j is connected and stops paying any facility

Example: Facility Location Algorithm t = c 8,9 = 20 t = c 0,5 = 37 t = 0 t = 72 t = c 0,7 = 77 t = 110 t = c 8,10 = 122

Outlier Detection Problem Input A set N of n nodes A number n r  relatively small A distance L  relatively large Output All outlier nodes r r is among a set, The distance between any node and is at least L

Algorithm Let user specify an upper limit l on the total number of outliers Instead of terminating the Prima-Dual stage after all clients are connected Terminate the stage when the number of unconnected clients becomes no more than l The unconnected clients are detected as outliers

Outlier Detection vs. Parameter Setting

Parameter Setting for Outlier detection The facility cost f i should neither too large nor to small For the inputs of the problem A set N of n nodes A number n r A distance L Let, where is a small constant

Outline Introduction Motivation Outlier Detection Incremental Placement Experimental Results Conclusions

Incremental Placement To eliminate outliers Improve timing on the critical paths containing the outliers Find these paths Force voltage reduction on the outliers, update all slacks Find all paths with negative slacks

Example: Eliminating Outliers Outlier

Setting Placement Constraints Adding additional net weights Let the pure timing driven placer pay more attention on those nets Increasing cell delays Select the outlier cells and the low-Vdd cells on the selected paths For those selected cells, use their delays under low-Vdd in timing analysis For the rest of cells, use the delays under high- Vdd

Example: Eliminating Outliers (contd.) C1 C3 C5 Outlier C1 C3 C5 Timing Analysis Force Voltage Reduction

Outline Introduction Motivation Outlier Detection Incremental Placement Experimental Results Conclusions

Experimental Results: Snap Shots Low High After 7 voltage islands & 7.85 unit power Before 7 voltage islands & 9.37 unit power

Experimental Results: Outlier Detection 314 nodes, 8 outliers1182 nodes, 8 outliers

Experimental Results

Comparison on Different Design

Running Time

Outline Introduction Motivation Outlier Detection Incremental Placement Experimental Results Conclusions

They proposed an incremental flow with consideration of outliers to improve voltage assignment Reduce the number of Voltage Islands