An Exact Algorithm for the Statistical Shortest Path Problem
|
|
- Cody Mathews
- 6 years ago
- Views:
Transcription
1 An Exact Algorithm for the Statistical Shortest Path Problem Liang Deng and Martin D. F. Wong Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign
2 Outline Motivation Statistical shortest path (SSP) problem Our exact algorithm for SSP problem Applications Maze Routing Timing Analysis Buffer Insertion
3 Why Statistical Methods? Intra-die variations become dominant Corner-based design flow leads to over design or yield loss Statistical methods are needed not only in simulation but also in design tools. Temperature Variation in Cell Processor Dac C. Pham, et al. ISSCC05
4 Variations, Performance and Yield Variation sources Process variations Gate length variation Geometric variation in interconnection wires Temperature variations Supply voltage variations Statistical models for circuits have been proposed New algorithm considering variations are needed for performance/yield optimization
5 Statistical Model for Variations Use mean µ and variance σ 2 to capture the random property of variations Exact for Gaussian, uniform, binominal, exponential distributions and etc. Good approximation for arbitrary random variables
6 Statistical Model for Variations Mean and variance are additive, but not the standard deviation σ Recall the Chebyshev s Inequality: P( X µ kσ ) > 1 The cost function µ+kσ is important to yield optimization σ not additive presents difficulties in solving statistical graph problems 1 k 2
7 Statistical Shortest Path Problem Edge weights are random variables a (10,4) t To find a path with minimum µ+φ(σ 2 ) value Existing methods cannot solve this problem s (14,5) (10,2) (14,24) b (8,14) (18,1) c (2,1) Edge weight: (mean, variance)
8 From Deterministic to Statistical Deterministic Edge weight w w is additive Path weight Σw Minimize Σw Statistical Edge weight ( µ,σ 2 ) µ,σ 2 are additive Path weight ( µ P, σ P2 ) Minimize µ P +Φ(σ P2 )
9 Statistical Shortest Path Problem Given a directed graph G Not necessarily a DAG Find a path p from source vertex s to sink vertex t such that µ P +Φ(σ P2 ) is minimized Path weight of p is a random variable with mean µ P and variance σ P 2
10 Practical Observations for EDA problems µ, σ 2 are additive For yield optimization problems σ 2 is bounded σ 2 can be discretized without introducing much error We may assume the variance σ 2 of path weight are integers upper bounded by B, i.e., σ 2 B
11 Algorithm for Solving SSP Problem Vertex splitting for µ, σ 2 Graph expansion to generate a new graph G G has real numbers as its edge weights Each vertex u in G is split into a set of vertices in G : {u 1,u 2,, u B }
12 Graph Expansion Source Node s (μ, σ 2 ) a From source to other vertices Only expand vertex a Each new vertex a i corresponds to a with variance i Edge weight is µ s μ a 1 a 2 a σ 2 a B
13 Graph Expansion Internal Nodes u (μ, σ 2 ) v Assuming vertex u is already split Its neighbor v will be also split Edges are connected according to σ 2 of path weight Edge weight are µ u 1 u 2 u 3 u B-σ 2 μ μ μ μ v 1 2 v σ +1 2 v σ +2 v 2 σ +3 u B v B
14 Graph Expansion Sink Node t Original sink node is already split according to previous steps Add a super sink node t Edge weight for edge ti to t is Φ(i) Note that any path from source to ti has variance equals to i t 1 t i t B Φ(i) t'
15 From Arbitrary Graph to DAG There will be no loop in expanded graph since σ 2 > 0 a 1 a i a σ 2 3 +i?? μ 1 b 1 b σ 2 +i 1 a (μ 3, σ 3 2 ) (μ 1, σ 1 2 ) b (μ 2, σ 2 2 ) a B μ 3 c 1 μ 2 b B c 2 c σ 2 +i c B
16 SSP Algorithm The expanded graph G is a DAG Shortest path in G can be found by existing deterministic shortest path algorithms for DAG This path corresponds to a path in G that minimizes µ P +Φ(σ P2 ) Time complexity is O(B(V+E))
17 Improvement Only split a vertex whenever it is necessary; don t split all vertices Remove redundant vertices during splitting If paths have same variance, then the one with larger mean is redundant If Φ(σ P2 ) is a monotonically increasing function, paths with larger mean and variance are redundant
18 Example (14,5) b (10,4) e 14 b e' a (10,2) (14,24) c (8,14) (18,1) d (2,1) a c d e Edge weight: (mean, variance) Φ ( x) = 3 x
19 SSP Algorithm Improved Much less vertices are generated 100 vertices needed for previous example with original approach 10 vertices used with improved algorithm Expand graph simultaneously with searching the shortest path Much faster with less memory requirement
20 EDA applications Maze Routing Timing Analysis Buffer Insertion
21 Maze Routing Timing-driven maze routing Process Variations Systematic variations Random variations Temperature variations Find the shortest path to improve the performance
22 Maze Routing Hot Cell Cold Cell No Variations considered Variations considered
23 Timing Analysis Find the longest delay path considering intra-die variations Large circuits with several logic levels Gaussian distribution for the path delay µ P +3σ P is used to measure the timing-yield Our algorithm can also find the (path) candidates with longest delay
24 Timing Analysis ISCAS benchmarks Cell delays are not necessarily Gaussian 40X 1000X runtime improvement over Monte Carlo simulation Very little error compare to Monte Carlo method
25 Buffer Insertion Buffer insertion in 2-pin net can be formulated into shortest path problem With variations from both devices and interconnections, it should be formulated into statistical shortest path problem Our algorithm can solve this buffer insertion with variations consideration
26 Buffer Insertion Graph based approach Formulated as a shortest path problem Drive Buffer Load Shortest Path
27 Conclusion Exact algorithm to solve the statistical shortest path problem Arbitrary graph, arbitrary cost function Φ Efficient implementation Can be used in varieties of applications in nanometer design
A Routing Approach to Reduce Glitches in Low Power FPGAs
A Routing Approach to Reduce Glitches in Low Power FPGAs Quang Dinh, Deming Chen, Martin Wong Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign This research
More informationBasic Idea. The routing problem is typically solved using a twostep
Global Routing Basic Idea The routing problem is typically solved using a twostep approach: Global Routing Define the routing regions. Generate a tentative route for each net. Each net is assigned to a
More informationVdd Programmable and Variation Tolerant FPGA Circuits and Architectures
Vdd Programmable and Variation Tolerant FPGA Circuits and Architectures Prof. Lei He EE Department, UCLA LHE@ee.ucla.edu Partially supported by NSF. Pathway to Power Efficiency and Variation Tolerance
More informationVariation Tolerant Buffered Clock Network Synthesis with Cross Links
Variation Tolerant Buffered Clock Network Synthesis with Cross Links Anand Rajaram David Z. Pan Dept. of ECE, UT-Austin Texas Instruments, Dallas Sponsored by SRC and IBM Faculty Award 1 Presentation Outline
More informationA Sensor-Assisted Self-Authentication Framework for Hardware Trojan Detection
A Sensor-Assisted Self-Authentication Framework for Hardware Trojan Detection Min Li, Azadeh Davoodi, and Mohammad Tehranipoor Department of Electrical and Computer Engineering University of Wisconsin
More informationUnit 7: Maze (Area) and Global Routing
Unit 7: Maze (Area) and Global Routing Course contents Routing basics Maze (area) routing Global routing Readings Chapters 9.1, 9.2, 9.5 Filling Unit 7 1 Routing Unit 7 2 Routing Constraints 100% routing
More informationPhysical Design of Digital Integrated Circuits (EN0291 S40) Sherief Reda Division of Engineering, Brown University Fall 2006
Physical Design of Digital Integrated Circuits (EN029 S40) Sherief Reda Division of Engineering, Brown University Fall 2006 Lecture 09: Routing Introduction to Routing Global Routing Detailed Routing 2
More informationChapter 5 Global Routing
Chapter 5 Global Routing 5. Introduction 5.2 Terminology and Definitions 5.3 Optimization Goals 5. Representations of Routing Regions 5.5 The Global Routing Flow 5.6 Single-Net Routing 5.6. Rectilinear
More informationSCHEDULING II Giovanni De Micheli Stanford University
SCHEDULING II Giovanni De Micheli Stanford University Scheduling under resource constraints Simplified models: Hu's algorithm. Heuristic algorithms: List scheduling. Force-directed scheduling. Hu's algorithm
More informationPlanning for Local Net Congestion in Global Routing
Planning for Local Net Congestion in Global Routing Hamid Shojaei, Azadeh Davoodi, and Jeffrey Linderoth* Department of Electrical and Computer Engineering *Department of Industrial and Systems Engineering
More informationCLOCK DRIVEN SCHEDULING
CHAPTER 4 By Radu Muresan University of Guelph Page 1 ENGG4420 CHAPTER 4 LECTURE 2 and 3 November 04 09 7:51 PM CLOCK DRIVEN SCHEDULING Clock driven schedulers make their scheduling decisions regarding
More informationStatistical Timing Analysis Using Bounds and Selective Enumeration
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 22, NO. 9, SEPTEMBER 2003 1243 Statistical Timing Analysis Using Bounds and Selective Enumeration Aseem Agarwal, Student
More informationVariation Aware Routing for Three-Dimensional FPGAs
Variation Aware Routing for Three-Dimensional FPGAs Chen Dong, Scott Chilstedt, and Deming Chen Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign {cdong3, chilste1,
More informationA Fast Estimation of SRAM Failure Rate Using Probability Collectives
A Fast Estimation of SRAM Failure Rate Using Probability Collectives Fang Gong Electrical Engineering Department, UCLA http://www.ee.ucla.edu/~fang08 Collaborators: Sina Basir-Kazeruni, Lara Dolecek, Lei
More informationCHAPTER 1 INTRODUCTION
CHAPTER 1 INTRODUCTION Rapid advances in integrated circuit technology have made it possible to fabricate digital circuits with large number of devices on a single chip. The advantages of integrated circuits
More informationIntroduction VLSI PHYSICAL DESIGN AUTOMATION
VLSI PHYSICAL DESIGN AUTOMATION PROF. INDRANIL SENGUPTA DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Introduction Main steps in VLSI physical design 1. Partitioning and Floorplanning l 2. Placement 3.
More informationMonte Carlo Methods; Combinatorial Search
Monte Carlo Methods; Combinatorial Search Parallel and Distributed Computing Department of Computer Science and Engineering (DEI) Instituto Superior Técnico November 22, 2012 CPD (DEI / IST) Parallel and
More informationElectromigration-aware Redundant Via Insertion
ASP-DAC 15 Electromigration-aware Redundant Via Insertion Jan. 21 st, 2015 Jiwoo Pak, Bei Yu, David Z. Pan The University of Texas at Austin Outline 1. Introduction 2. EM modeling for redundant vias 3.
More informationSymmetrical Buffered Clock-Tree Synthesis with Supply-Voltage Alignment
Symmetrical Buffered Clock-Tree Synthesis with Supply-Voltage Alignment Xin-Wei Shih, Tzu-Hsuan Hsu, Hsu-Chieh Lee, Yao-Wen Chang, Kai-Yuan Chao 2013.01.24 1 Outline 2 Clock Network Synthesis Clock network
More informationCombinatorial Search; Monte Carlo Methods
Combinatorial Search; Monte Carlo Methods Parallel and Distributed Computing Department of Computer Science and Engineering (DEI) Instituto Superior Técnico May 02, 2016 CPD (DEI / IST) Parallel and Distributed
More informationGraph Models for Global Routing: Grid Graph
Graph Models for Global Routing: Grid Graph Each cell is represented by a vertex. Two vertices are joined by an edge if the corresponding cells are adjacent to each other. The occupied cells are represented
More informationProcess-Induced Skew Variation for Scaled 2-D and 3-D ICs
Process-Induced Skew Variation for Scaled 2-D and 3-D ICs Hu Xu, Vasilis F. Pavlidis, and Giovanni De Micheli LSI-EPFL July 26, 2010 SLIP 2010, Anaheim, USA Presentation Outline 2-D and 3-D Clock Distribution
More informationTiming Analysis and Optimization Techniques for VLSI Circuits
NORTHWESTERN UNIVERSITY Timing Analysis and Optimization Techniques for VLSI Circuits A DISSERTATION SUBMITTED TO THE GRADUATE SCHOOL IN PARTIAL FULFILLMENT OF THE REQUIREMENTS for the degree DOCTOR OF
More informationAN OPTIMIZED ALGORITHM FOR SIMULTANEOUS ROUTING AND BUFFER INSERTION IN MULTI-TERMINAL NETS
www.arpnjournals.com AN OPTIMIZED ALGORITHM FOR SIMULTANEOUS ROUTING AND BUFFER INSERTION IN MULTI-TERMINAL NETS C. Uttraphan 1, N. Shaikh-Husin 2 1 Embedded Computing System (EmbCoS) Research Focus Group,
More informationFast Dual-V dd Buffering Based on Interconnect Prediction and Sampling
Based on Interconnect Prediction and Sampling Yu Hu King Ho Tam Tom Tong Jing Lei He Electrical Engineering Department University of California at Los Angeles System Level Interconnect Prediction (SLIP),
More informationRetiming and Clock Scheduling for Digital Circuit Optimization
184 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 21, NO. 2, FEBRUARY 2002 Retiming and Clock Scheduling for Digital Circuit Optimization Xun Liu, Student Member,
More informationDpRouter: A Fast and Accurate Dynamic- Pattern-Based Global Routing Algorithm
DpRouter: A Fast and Accurate Dynamic- Pattern-Based Global Routing Algorithm Zhen Cao 1,Tong Jing 1, 2, Jinjun Xiong 2, Yu Hu 2, Lei He 2, Xianlong Hong 1 1 Tsinghua University 2 University of California,
More informationExperience in Critical Path Selection For Deep Sub-Micron Delay Test and Timing Validation
Experience in Critical Path Selection For Deep Sub-Micron Delay Test and Timing Validation Jing-Jia Liou, Li-C. Wang, Angela Krstic, and Kwang-Ting Cheng University of California at Santa Barbara Abstract
More informationCluster-based approach eases clock tree synthesis
Page 1 of 5 EE Times: Design News Cluster-based approach eases clock tree synthesis Udhaya Kumar (11/14/2005 9:00 AM EST) URL: http://www.eetimes.com/showarticle.jhtml?articleid=173601961 Clock network
More informationOn Constructing Lower Power and Robust Clock Tree via Slew Budgeting
1 On Constructing Lower Power and Robust Clock Tree via Slew Budgeting Yeh-Chi Chang, Chun-Kai Wang and Hung-Ming Chen Dept. of EE, National Chiao Tung University, Taiwan 2012 年 3 月 29 日 Outline 2 Motivation
More informationRecursive-Fib(n) if n=1 or n=2 then return 1 else return Recursive-Fib(n-1)+Recursive-Fib(n-2)
Dynamic Programming Any recursive formula can be directly translated into recursive algorithms. However, sometimes the compiler will not implement the recursive algorithm very efficiently. When this is
More informationClass Overview. Introduction to Artificial Intelligence COMP 3501 / COMP Lecture 2. Problem Solving Agents. Problem Solving Agents: Assumptions
Class Overview COMP 3501 / COMP 4704-4 Lecture 2 Prof. JGH 318 Problem Solving Agents Problem Solving Agents: Assumptions Requires a goal Assume world is: Requires actions Observable What actions? Discrete
More informationVLSI Physical Design: From Graph Partitioning to Timing Closure
Chapter 5 Global Routing Original uthors: ndrew. Kahng, Jens, Igor L. Markov, Jin Hu Chapter 5 Global Routing 5. Introduction 5.2 Terminology and Definitions 5.3 Optimization Goals 5. Representations of
More informationStatistical Modeling of Pipeline Delay and Design of Pipeline under Process Variation to Enhance Yield in sub-100nm Technologies *
Statistical Modeling of Pipeline Delay and Design of Pipeline under Process Variation to Enhance Yield in sub-nm Technologies * Animesh Datta, Swarup Bhunia, Saibal Mukhopadhyay, ilanjan Banerjee, and
More informationFigure 1: An example of a hypercube 1: Given that the source and destination addresses are n-bit vectors, consider the following simple choice of rout
Tail Inequalities Wafi AlBalawi and Ashraf Osman Department of Computer Science and Electrical Engineering, West Virginia University, Morgantown, WV fwafi,osman@csee.wvu.edug 1 Routing in a Parallel Computer
More informationVariation-Aware Routing for FPGAs
Variation-Aware Routing for FPGAs Satish Sivaswamy Dept. of Electrical Engineering University of Minnesota, MN 55455 satish@umn.edu Kia Bazargan Dept. of Electrical Engineering University of Minnesota,
More informationRegular Fabrics for Retiming & Pipelining over Global Interconnects
Regular Fabrics for Retiming & Pipelining over Global Interconnects Jason Cong Computer Science Department University of California, Los Angeles cong@cs cs.ucla.edu http://cadlab cadlab.cs.ucla.edu/~cong
More informationTemperature-Aware Routing in 3D ICs
Temperature-Aware Routing in 3D ICs Tianpei Zhang, Yong Zhan and Sachin S. Sapatnekar Department of Electrical and Computer Engineering University of Minnesota 1 Outline Temperature-aware 3D global routing
More informationObstacle-Aware Longest-Path Routing with Parallel MILP Solvers
, October 20-22, 2010, San Francisco, USA Obstacle-Aware Longest-Path Routing with Parallel MILP Solvers I-Lun Tseng, Member, IAENG, Huan-Wen Chen, and Che-I Lee Abstract Longest-path routing problems,
More information10/5/2016. Review of General Bit-Slice Model. ECE 120: Introduction to Computing. Initialization of a Serial Comparator
University of Illinois at Urbana-Champaign Dept. of Electrical and Computer Engineering ECE 120: Introduction to Computing Example of Serialization Review of General Bit-Slice Model General model parameters
More informationCMOS Logic Gate Performance Variability Related to Transistor Network Arrangements
CMOS Logic Gate Performance Variability Related to Transistor Network Arrangements Digeorgia N. da Silva, André I. Reis, Renato P. Ribas PGMicro - Federal University of Rio Grande do Sul, Av. Bento Gonçalves
More informationICS 252 Introduction to Computer Design
ICS 252 Introduction to Computer Design Lecture 16 Eli Bozorgzadeh Computer Science Department-UCI References and Copyright Textbooks referred (none required) [Mic94] G. De Micheli Synthesis and Optimization
More informationThe Plan: Basic statistics: Random and pseudorandom numbers and their generation: Chapter 16.
Scientific Computing with Case Studies SIAM Press, 29 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit IV Monte Carlo Computations Dianne P. O Leary c 28 What is a Monte-Carlo method?
More informationA Statistical Framework for Post-Silicon Tuning through Body Bias Clustering
A Statistical Framework for Post-Silicon Tuning through Body Bias Clustering Sarvesh H Kulkarni Dennis Sylvester David Blaauw EECS Department, University of Michigan, Ann Arbor, MI 4819, USA { shkulkar,
More informationGenetic Algorithms For Vertex. Splitting in DAGs 1
Genetic Algorithms For Vertex Splitting in DAGs 1 Matthias Mayer 2 and Fikret Ercal 3 CSC-93-02 Fri Jan 29 1993 Department of Computer Science University of Missouri-Rolla Rolla, MO 65401, U.S.A. (314)
More informationSimultaneous OPC- and CMP-Aware Routing Based on Accurate Closed-Form Modeling
Simultaneous OPC- and CMP-Aware Routing Based on Accurate Closed-Form Modeling Shao-Yun Fang, Chung-Wei Lin, Guang-Wan Liao, and Yao-Wen Chang March 26, 2013 Graduate Institute of Electronics Engineering
More informationScientific Computing with Case Studies SIAM Press, Lecture Notes for Unit IV Monte Carlo
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit IV Monte Carlo Computations Dianne P. O Leary c 2008 1 What is a Monte-Carlo
More informationLecture 21 : A Hybrid: Deep Learning and Graphical Models
10-708: Probabilistic Graphical Models, Spring 2018 Lecture 21 : A Hybrid: Deep Learning and Graphical Models Lecturer: Kayhan Batmanghelich Scribes: Paul Liang, Anirudha Rayasam 1 Introduction and Motivation
More informationc 2011 Yun Wei Chang
c 2011 Yun Wei Chang SINGLE-LAYER BUS ROUTING FOR HIGH-SPEED BOARDS BY YUN WEI CHANG THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Electrical and Computer
More informationHomology cycle bases from acyclic matchings
Homology cycle bases from acyclic matchings Dmitry Feichtner-Kozlov University of Bremen Kyoto Workshop, January 019 What is... Applied Topology? studying global features of shapes applications in other
More informationEfficient Second-Order Iterative Methods for IR Drop Analysis in Power Grid
Efficient Second-Order Iterative Methods for IR Drop Analysis in Power Grid Yu Zhong Martin D. F. Wong Dept. of Electrical and Computer Engineering Dept. of Electrical and Computer Engineering Univ. of
More informationBuffered Routing Tree Construction Under Buffer Placement Blockages
Buffered Routing Tree Construction Under Buffer Placement Blockages Abstract Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering
More informationImprovements to Monte-Carlo for Static Timing Analysis
Improvements to Monte-Carlo for Static Timing Analysis A Survey I. INTRODUCTION Haik Kalantarian Electrical Engineering UCLA In this report, we provide a survey of six different papers that discuss the
More informationProblem Set 3. MATH 778C, Spring 2009, Austin Mohr (with John Boozer) April 15, 2009
Problem Set 3 MATH 778C, Spring 2009, Austin Mohr (with John Boozer) April 15, 2009 1. Show directly that P 1 (s) P 1 (t) for all t s. Proof. Given G, let H s be a subgraph of G on s vertices such that
More informationA Thermal-aware Application specific Routing Algorithm for Network-on-chip Design
A Thermal-aware Application specific Routing Algorithm for Network-on-chip Design Zhi-Liang Qian and Chi-Ying Tsui VLSI Research Laboratory Department of Electronic and Computer Engineering The Hong Kong
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 13 Random Numbers and Stochastic Simulation Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright
More informationVLSI Physical Design: From Graph Partitioning to Timing Closure
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5 Global Routing Original uthors: ndrew. Kahng, Jens, Igor L. Markov, Jin Hu VLSI Physical Design: From Graph Partitioning to Timing
More informationSHAPE APPROXIMATION OF PRINTED IMAGES IN VLSI DESIGN KHINE NYOLE HAN. B.S., University of Illinois at Urbana-Champaign, 2007 THESIS
SHAPE APPROXIMATION OF PRINTED IMAGES IN VLSI DESIGN BY KHINE NYOLE HAN B.S., University of Illinois at Urbana-Champaign, 2007 THESIS Submitted in partial fulfillment of the requirements for the degree
More informationarxiv: v1 [cs.ar] 14 May 2017
Fast Statistical Timing Analysis for Circuits with Post-Silicon Tunable Clock Buffers Bing Li, Ning Chen, Ulf Schlichtmann Institute for Electronic Design Automation, Technische Universitaet Muenchen,
More informationLevel-set MCMC Curve Sampling and Geometric Conditional Simulation
Level-set MCMC Curve Sampling and Geometric Conditional Simulation Ayres Fan John W. Fisher III Alan S. Willsky February 16, 2007 Outline 1. Overview 2. Curve evolution 3. Markov chain Monte Carlo 4. Curve
More informationMetal-Density Driven Placement for CMP Variation and Routability
Metal-Density Driven Placement for CMP Variation and Routability ISPD-2008 Tung-Chieh Chen 1, Minsik Cho 2, David Z. Pan 2, and Yao-Wen Chang 1 1 Dept. of EE, National Taiwan University 2 Dept. of ECE,
More informationDouble Patterning-Aware Detailed Routing with Mask Usage Balancing
Double Patterning-Aware Detailed Routing with Mask Usage Balancing Seong-I Lei Department of Computer Science National Tsing Hua University HsinChu, Taiwan Email: d9762804@oz.nthu.edu.tw Chris Chu Department
More informationParameterized Complexity - an Overview
Parameterized Complexity - an Overview 1 / 30 Parameterized Complexity - an Overview Ue Flarup 1 flarup@imada.sdu.dk 1 Department of Mathematics and Computer Science University of Southern Denmark, Odense,
More informationInter and Intra-Modal Deformable Registration:
Inter and Intra-Modal Deformable Registration: Continuous Deformations Meet Efficient Optimal Linear Programming Ben Glocker 1,2, Nikos Komodakis 1,3, Nikos Paragios 1, Georgios Tziritas 3, Nassir Navab
More informationParallel Implementation of VLSI Gate Placement in CUDA
ME 759: Project Report Parallel Implementation of VLSI Gate Placement in CUDA Movers and Placers Kai Zhao Snehal Mhatre December 21, 2015 1 Table of Contents 1. Introduction...... 3 2. Problem Formulation...
More informationExtracting the K-most Critical Paths in Multi-corner Multi-mode for Fast Static Timing Analysis
JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, VOL.16, NO.6, DECEMBER, 2016 ISSN(Print) 1598-1657 https://doi.org/10.5573/jsts.2016.16.6.771 ISSN(Online) 2233-4866 Extracting the K-most Critical Paths
More informationA premilinary study of the OECD/NEA 3D transport problem using the lattice code DRAGON
A premilinary study of the OECD/NEA 3D transport problem using the lattice code DRAGON Nicolas Martin, Guy Marleau, Alain Hébert Institut de Génie Nucléaire École Polytechnique de Montréal 28 CNS Symposium
More informationOnline Stochastic Matching CMSC 858F: Algorithmic Game Theory Fall 2010
Online Stochastic Matching CMSC 858F: Algorithmic Game Theory Fall 2010 Barna Saha, Vahid Liaghat Abstract This summary is mostly based on the work of Saberi et al. [1] on online stochastic matching problem
More informationComputer Vision 2 Lecture 8
Computer Vision 2 Lecture 8 Multi-Object Tracking (30.05.2016) leibe@vision.rwth-aachen.de, stueckler@vision.rwth-aachen.de RWTH Aachen University, Computer Vision Group http://www.vision.rwth-aachen.de
More informationMULTI-DIMENSIONAL MONTE CARLO INTEGRATION
CS580: Computer Graphics KAIST School of Computing Chapter 3 MULTI-DIMENSIONAL MONTE CARLO INTEGRATION 2 1 Monte Carlo Integration This describes a simple technique for the numerical evaluation of integrals
More informationBody Bias Voltage Computations for Process and Temperature Compensation
1 Body Bias Voltage Computations for Process and Temperature Compensation Sanjay V. Kumar, Chris H. Kim, and Sachin S. Sapatnekar Department of Electrical and Computer Engineering, University of Minnesota,
More informationA Novel Methodology to Debug Leakage Power Issues in Silicon- A Mobile SoC Ramp Production Case Study
A Novel Methodology to Debug Leakage Power Issues in Silicon- A Mobile SoC Ramp Production Case Study Ravi Arora Co-Founder & CTO, Graphene Semiconductors India Pvt Ltd, India ABSTRACT: As the world is
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 36
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 36 CS 473: Algorithms, Spring 2018 LP Duality Lecture 20 April 3, 2018 Some of the
More informationOUTLINE Introduction Power Components Dynamic Power Optimization Conclusions
OUTLINE Introduction Power Components Dynamic Power Optimization Conclusions 04/15/14 1 Introduction: Low Power Technology Process Hardware Architecture Software Multi VTH Low-power circuits Parallelism
More informationEDA - Electronic Design Automation or Electronic Design Assistance?
EDA - Electronic Design Automation or Electronic Design Assistance? NSF Workshop Electronic Design Automation Past, Present, and Future Andreas Kuehlmann NSF Workshop, July 8 9 2009 The Past The Vision
More informationA 19.4 nj/decision 364K Decisions/s In-Memory Random Forest Classifier in 6T SRAM Array. Mingu Kang, Sujan Gonugondla, Naresh Shanbhag
A 19.4 nj/decision 364K Decisions/s In-Memory Random Forest Classifier in 6T SRAM Array Mingu Kang, Sujan Gonugondla, Naresh Shanbhag University of Illinois at Urbana Champaign Machine Learning under Resource
More informationEfficient Block-Based Parameterized Timing Analysis Covering All Potentially Critical Paths
Efficient Block-Based Parameterized Timing Analysis Covering All Potentially Critical Paths Khaled R. Heloue Department of ECE University of Toronto Toronto, Ontario, Canada khaled@eecg.utoronto.ca Sari
More informationDiscrete Mathematics Course Review 3
21-228 Discrete Mathematics Course Review 3 This document contains a list of the important definitions and theorems that have been covered thus far in the course. It is not a complete listing of what has
More informationGraph Contraction. Graph Contraction CSE341T/CSE549T 10/20/2014. Lecture 14
CSE341T/CSE549T 10/20/2014 Lecture 14 Graph Contraction Graph Contraction So far we have mostly talking about standard techniques for solving problems on graphs that were developed in the context of sequential
More informationProcessing and Others. Xiaojun Qi -- REU Site Program in CVMA
Advanced Digital Image Processing and Others Xiaojun Qi -- REU Site Program in CVMA (0 Summer) Segmentation Outline Strategies and Data Structures Overview of Algorithms Region Splitting Region Merging
More information472 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 31, NO. 4, APRIL 2012
472 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 31, NO. 4, APRIL 2012 Efficient Block-Based Parameterized Timing Analysis Covering All Potentially Critical Paths
More informationCS612 Algorithms for Electronic Design Automation. Global Routing
CS612 Algorithms for Electronic Design Automation Global Routing Mustafa Ozdal CS 612 Lecture 7 Mustafa Ozdal Computer Engineering Department, Bilkent University 1 MOST SLIDES ARE FROM THE BOOK: MODIFICATIONS
More informationMean Field and Variational Methods finishing off
Readings: K&F: 10.1, 10.5 Mean Field and Variational Methods finishing off Graphical Models 10708 Carlos Guestrin Carnegie Mellon University November 5 th, 2008 10-708 Carlos Guestrin 2006-2008 1 10-708
More informationTHE widespread use of embedded cores in system-on-chip
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 12, NO. 12, DECEMBER 2004 1263 SOC Test Planning Using Virtual Test Access Architectures Anuja Sehgal, Member, IEEE, Vikram Iyengar,
More informationSpayn Worst-Case Modeling
Presentation Outline Motivation Requirements for Accurate Worst-Case Modeling Traditional Approach to Worst-Case Modeling PCA or PFA Approach Worst-Case Design Techniques Employing PCA or PFA Worst-Case
More informationYield-Driven, False-Path-Aware Clock Skew Scheduling
Yield-Driven, False-Path-Aware Clock Skew Scheduling Jeng-Liang Tsai, Dong Hyun Baik, Charlie Chung-Ping Chen, and Kewal K. Saluja University of Wisconsin-Madison Editor s note: This article proposes clock
More informationGate Sizing by Lagrangian Relaxation Revisited
Gate Sizing by Lagrangian Relaxation Revisited Jia Wang, Debasish Das, and Hai Zhou Electrical Engineering and Computer Science Northwestern University Evanston, Illinois, United States October 17, 2007
More informationCMP Model Application in RC and Timing Extraction Flow
INVENTIVE CMP Model Application in RC and Timing Extraction Flow Hongmei Liao*, Li Song +, Nickhil Jakadtar +, Taber Smith + * Qualcomm Inc. San Diego, CA 92121 + Cadence Design Systems, Inc. San Jose,
More informationU.C. Berkeley CS170 : Algorithms Midterm 1 Lecturers: Alessandro Chiesa and Satish Rao September 18, Midterm 1
U.C. Berkeley CS170 : Algorithms Lecturers: Alessandro Chiesa and Satish Rao September 18, 2018 1 Connectivity in Graphs No justification is required on this problem. A B C D E F G H I J (a) (2 points)
More informationALGORITHMIC STUDIES ON PCB ROUTING TAN YAN DISSERTATION
c 2010 Tan Yan ALGORITHMIC STUDIES ON PCB ROUTING BY TAN YAN DISSERTATION Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Electrical and Computer Engineering
More informationModule 6 NP-Complete Problems and Heuristics
Module 6 NP-Complete Problems and Heuristics Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu P, NP-Problems Class
More informationReach for A : an Efficient Point-to-Point Shortest Path Algorithm
Reach for A : an Efficient Point-to-Point Shortest Path Algorithm Andrew V. Goldberg Microsoft Research Silicon Valley www.research.microsoft.com/ goldberg/ Joint with Haim Kaplan and Renato Werneck Einstein
More information10/24/2016. Let s Name Some Groups of Bits. ECE 120: Introduction to Computing. We Just Need a Few More. You Want to Use What as Names?!
University of Illinois at Urbana-Champaign Dept. of Electrical and Computer Engineering ECE 120: Introduction to Computing Memory Let s Name Some Groups of Bits I need your help. The computer we re going
More informationInterconnect Delay and Area Estimation for Multiple-Pin Nets
Interconnect Delay and Area Estimation for Multiple-Pin Nets Jason Cong and David Z. Pan UCLA Computer Science Department Los Angeles, CA 90095 Sponsored by SRC and Avant!! under CA-MICRO Presentation
More information10703 Deep Reinforcement Learning and Control
10703 Deep Reinforcement Learning and Control Russ Salakhutdinov Machine Learning Department rsalakhu@cs.cmu.edu Policy Gradient I Used Materials Disclaimer: Much of the material and slides for this lecture
More informationClass Overview. Introduction to Artificial Intelligence COMP 3501 / COMP Lecture 2: Search. Problem Solving Agents
Class Overview COMP 3501 / COMP 4704-4 Lecture 2: Search Prof. 1 2 Problem Solving Agents Problem Solving Agents: Assumptions Requires a goal Assume world is: Requires actions Observable What actions?
More informationHigh-Level Synthesis
High-Level Synthesis 1 High-Level Synthesis 1. Basic definition 2. A typical HLS process 3. Scheduling techniques 4. Allocation and binding techniques 5. Advanced issues High-Level Synthesis 2 Introduction
More informationPushPull: Short Path Padding for Timing Error Resilient Circuits YU-MING YANG IRIS HUI-RU JIANG SUNG-TING HO. IRIS Lab National Chiao Tung University
PushPull: Short Path Padding for Timing Error Resilient Circuits YU-MING YANG IRIS HUI-RU JIANG SUNG-TING HO IRIS Lab National Chiao Tung University Outline Introduction Problem Formulation Algorithm -
More informationObject Recognition Using Pictorial Structures. Daniel Huttenlocher Computer Science Department. In This Talk. Object recognition in computer vision
Object Recognition Using Pictorial Structures Daniel Huttenlocher Computer Science Department Joint work with Pedro Felzenszwalb, MIT AI Lab In This Talk Object recognition in computer vision Brief definition
More informationOn Comparing Conventional and Electrically Driven OPC Techniques
On Comparing Conventional and Electrically Driven OPC Techniques Dominic Reinhard and Puneet Gupta EE Dept., University of California, Los Angeles {dominicr,puneet}@ee.ucla.edu ABSTRACT This paper compares
More information