DELAY INSERTION METHOD IN CLOCK SKEW SCHEDULING BARIS TASKIN and IVAN S. KOURTEV ISPD 2005 High Performance Integrated Circuit Design Lab. Department of.

Slides:



Advertisements
Similar presentations
1 A latch is a pair of cross-coupled inverters –They can be NAND or NOR gates as shown –Consider their behavior (each step is one gate delay in time) –From.
Advertisements

1 Lecture 16 Timing  Terminology  Timing issues  Asynchronous inputs.
OCV-Aware Top-Level Clock Tree Optimization
1 COMP541 Flip-Flop Timing Montek Singh Oct 6, 2014.
Courtesy RK Brayton (UCB) and A Kuehlmann (Cadence) 1 Logic Synthesis Sequential Synthesis.
Modern VLSI Design 4e: Chapter 5 Copyright  2008 Wayne Wolf Topics n Performance analysis of sequential machines.
4/22/ Clock Network Synthesis Prof. Shiyan Hu Office: EREC 731.
Introduction to CMOS VLSI Design Sequential Circuits.
Introduction to Sequential Logic Design Latches. 2 Terminology A bistable memory device is the generic term for the elements we are studying. Latches.
A Robust, Fast Pulsed Flip- Flop Design By: Arunprasad Venkatraman Rajesh Garg Sunil Khatri Department of Electrical and Computer Engineering, Texas A.
Introduction to CMOS VLSI Design Sequential Circuits
ECE C03 Lecture 81 Lecture 8 Memory Elements and Clocking Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Lecture 11: Sequential Circuit Design. CMOS VLSI DesignCMOS VLSI Design 4th Ed. 11: Sequential Circuits2 Outline  Sequencing  Sequencing Element Design.
Clock Skewing EECS 290A Sequential Logic Synthesis and Verification.
Sequential Timing Optimization. Long path timing constraints Data must not reach destination FF too late s i + d(i,j) + T setup  s j + P s i s j d(i,j)
Z. Feng MTU EE4800 CMOS Digital IC Design & Analysis EE4800 CMOS Digital IC Design & Analysis Lecture 11 Sequential Circuit Design Zhuo Feng.
Variability-Driven Formulation for Simultaneous Gate Sizing and Post-Silicon Tunability Allocation Vishal Khandelwal and Ankur Srivastava Department of.
Sequential Logic 1 clock data in may changestable data out (Q) stable Registers  Sample data using clock  Hold data between clock cycles  Computation.
PERFORMANCE OPTIMIZATION OF SINGLE-PHASE LEVEL-SENSITIVE CIRCUITS BARIS TASKIN AND IVAN S. KOURTEV UNIVERSITY OF PITTSBURGH DEPARTMENT OF ELECTRICAL ENGINEERING.
EE141 © Digital Integrated Circuits 2nd Timing Issues 1 Digital Integrated Circuits A Design Perspective Timing Issues Jan M. Rabaey Anantha Chandrakasan.
Topological Design of Clock Distribution Networks Based on Non-Zero Clock Skew Specification A Class Presentation for VLSI course By: Sareh Mohebali By:
A Useful Skew Tree Framework for Inserting Large Safety Margins Rickard Ewetz and Cheng-Kok Koh School of Electrical and Computer Engineering, Purdue University.
VLSI Physical Design: From Graph Partitioning to Timing Closure Paper Presentation © KLMH Lienig 1 EECS 527 Paper Presentation Topological Design of Clock.
Fall 06, Sep 19, 21 ELEC / Lecture 6 1 ELEC / (Fall 2005) Special Topics in Electrical Engineering Low-Power Design of Electronic.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Dr. Shi Dept. of Electrical and Computer Engineering.
ENGIN112 L28: Timing Analysis November 7, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 28 Timing Analysis.
May 14, ISVLSI 09 Algorithms for Estimating Number of Glitches and Dynamic Power in CMOS Circuits with Delay Variations Jins Davis Alexander Vishwani.
EE141 © Digital Integrated Circuits 2nd Timing Issues 1 Latch-based Design.
Statistical Crosstalk Aggressor Alignment Aware Interconnect Delay Calculation Supported by NSF & MARCO GSRC Andrew B. Kahng, Bao Liu, Xu Xu UC San Diego.
Sequential Logic 1  Combinational logic:  Compute a function all at one time  Fast/expensive  e.g. combinational multiplier  Sequential logic:  Compute.
Design and Implementation of VLSI Systems (EN1600) Lecture 23: Sequential Circuit Design (2/2) Prof. Sherief Reda Division of Engineering, Brown University.
Continuous Retiming EECS 290A Sequential Logic Synthesis and Verification.
1 EECS Components and Design Techniques for Digital Systems Lec 21 – RTL Design Optimization 11/16/2004 David Culler Electrical Engineering and Computer.
1 UCSD VLSI CAD Laboratory ISQED-2009 Revisiting the Linear Programming Framework for Leakage Power vs. Performance Optimization Kwangok Jeong, Andrew.
S. Reda EN160 SP’07 Design and Implementation of VLSI Systems (EN0160) Lecture 25: Sequential Circuit Design (3/3) Prof. Sherief Reda Division of Engineering,
Jan. 2007VLSI Design '071 Statistical Leakage and Timing Optimization for Submicron Process Variation Yuanlin Lu and Vishwani D. Agrawal ECE Dept. Auburn.
Spring 07, Mar 20 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2007 A Linear Programming Solution to Clock Constraint.
Statistical Gate Delay Calculation with Crosstalk Alignment Consideration Andrew B. Kahng, Bao Liu, Xu Xu UC San Diego
Introduction to CMOS VLSI Design Lecture 10: Sequential Circuits
Introduction to CMOS VLSI Design Lecture 10: Sequential Circuits Credits: David Harris Harvey Mudd College (Material taken/adapted from Harris’ lecture.
Temporizzazioni e sincronismo1 Progettazione di circuiti e sistemi VLSI Anno Accademico Lezione Temporizzazioni e sincronizzazione.
1 Jieyi Long, Ja Chun Ku, Seda Ogrenci Memik, Yehea Ismail Dept. of EECS, Northwestern Univ. SACTA: A Self-Adjusting Clock Tree Architecture to Cope with.
CS 151 Digital Systems Design Lecture 28 Timing Analysis.
Fall 2007 L16: Memory Elements LECTURE 16: Clocks Sequential circuit design The basic memory element: a latch Flip Flops.
Sequential Circuits Chapter 4 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer,  S.
Introduction to Sequential Logic Design Flip-flops.
Determining the Optimal Process Technology for Performance- Constrained Circuits Michael Boyer & Sudeep Ghosh ECE 563: Introduction to VLSI December 5.
26 th International Conference on VLSI January 2013 Pune,India Optimum Test Schedule for SoC with Specified Clock Frequencies and Supply Voltages Vijay.
A Robust Pulse-triggered Flip-Flop and Enhanced Scan Cell Design
Digital System Clocking: High-Performance and Low-Power Aspects Vojin G. Oklobdzija, Vladimir M. Stojanovic, Dejan M. Markovic, Nikola M. Nedovic Wiley-Interscience.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
Sequential Networks: Timing and Retiming
June clock data Q-flop Flop dataQ clock Flip-flop is edge triggered. It transfers input data to Q on clock rising edge. Memory Elements.
Digital System Clocking: High-Performance and Low-Power Aspects Vojin G. Oklobdzija, Vladimir M. Stojanovic, Dejan M. Markovic, Nikola M. Nedovic Wiley-Interscience.
1 COMP541 Sequential Logic Timing Montek Singh Sep 30, 2015.
EE 466/586 VLSI Design Partha Pande School of EECS Washington State University
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 24: November 5, 2012 Synchronous Circuits.
Retiming EECS 290A Sequential Logic Synthesis and Verification.
Dept. of Electrical Engineering
EE141 Timing Issues 1 Chapter 10 Timing Issues Rev /11/2003 Rev /28/2003 Rev /05/2003.
EE141 Timing Issues 1 Chapter 10 Timing Issues Rev /11/2003.
James D. Z. Ma Department of Electrical and Computer Engineering
ELEC 7770 Advanced VLSI Design Spring 2016 Clock Skew Problem
ELEC 7770 Advanced VLSI Design Spring 2012 Clock Skew Problem
ELEC 7770 Advanced VLSI Design Spring 2014 Clock Skew Problem
Timing Analysis 11/21/2018.
Topics Performance analysis..
Pipeline Principle A non-pipelined system of combination circuits (A, B, C) that computation requires total of 300 picoseconds. Comb. logic.
Vishwani D. Agrawal James J. Danaher Professor
Vishwani D. Agrawal James J. Danaher Professor
Presentation transcript:

DELAY INSERTION METHOD IN CLOCK SKEW SCHEDULING BARIS TASKIN and IVAN S. KOURTEV ISPD 2005 High Performance Integrated Circuit Design Lab. Department of Electrical and Computer Engineering

Outline Background and Motivation Topological Limitations on CSS Experimental Results Conclusions

Introduction High-Performance IC Clock skew scheduling Target: Minimum clock period Observe limitations –Theoretically

Research Objective Objective: Improve the efficiency and results of clock skew scheduling through systematic delay insertion Reconvergent paths Edge-sensitive circuits Level-sensitive circuits

Local data path Circuit graph System Modeling

Timing Parameters

Flip-Flop Operation Positive edge-triggered

Latch Operation Positive level-sensitive

Time Borrowing Flip-Flop basedLatch based T FF = D P 12 T L  D P 12 =T FF

Clock Skew T skew (i,f) = t i - t f Clock signal delay at the initial register Clock signal delay at the final register

Clock Skew Scheduling CIRCUIT TOPOLOGY CLOCKING METHODOLOGY MAX OP. FREQUENCY TIMING SCHEDULE CLOCKING SCHEDULE SENSITIVITY * INPUT OUTPUT

CSS: Edge-Sensitive Zero clock skew Non-zero clock skew T FF = D P 12 T FF skewed  D P 12 =T FF

Edge-Sensitive CSS Model Linear Programming (LP) model 1: J. P. Fishburn, Clock Skew Optimization, IEEE Transactions on Computers, Vol C-39, pp , July

CSS for Level-Sensitive Flip-flop-based Zero clock skew Latch-based Non-zero clock skew T FF = D P 12 T L skewed  T L  D P 12 =T FF

Level-Sensitive CSS Model Linear Programming (LP) model 1: B. Taskin and I.S. Kourtev, Linearization of the Timing Analysis and Optimization Level-Sensitive Digital Synchronous Circuits, IEEE Transactions on VLSI, Vol 12, No 1, pp , January

CSS Topological Limitations Series of data paths –Small practical limitations on CSS Data path cycles –Limit minimum clock period Reconvergent paths –Unexplored –They do matter!

Linear Topology Series of local data paths Small practical limits for clock skew scheduling

Linear Topology Timing 1

Linear Topology Timing 2

Data Path Cycles Defined for retiming Limiting for clock skew scheduling

Data Path Cycles Timing

Reconvergent Paths Common topology Lower bound T min

Reconvergent Paths Timing

Delay Insertion Add delays to some paths Modify shortest and potentially longest path delays

Reconvergent Path Timing DI

CSS-DI for Edge-Sensitive I M if I m I m I M

CSS-DI for Level-Sensitive I m if I M I m I M

Implementation Highlights Corner cases for delays Stand-alone frameworks –Edge-sensitive –Level-sensitive Reasonable run-times –Under 2 minutes with barrier optimizer

Edge-Sensitive Results Improvement CLOCK SKEW SCHEDULING28% CLOCK SKEW SCHEDULING WITH DELAY INSERTION 34%

Level-Sensitive Results Improvement CLOCK SKEW SCHEDULING29% CLOCK SKEW SCHEDULING WITH DELAY INSERTION 34%

Quantitative Summary Delay insertion applicable to –41% of edge-triggered ISCAS’89 circuits –34% of the level-sensitive Improvement over conventional CSS –10% for edge-triggered (26% when applicable) –9% for level-sensitive (27% when applicable)

Conclusions Delay insertion to logic –Systematic Requires topological analysis –Linear, cycle, reconvergent Practical requirements –Design budget for delay insertion –Discrete delay values –Placement

DELAY INSERTION METHOD IN CLOCK SKEW SCHEDULING QUESTIONS?

Clock Period Minimization Problem - 1 Objective function : min T Problem variables –For each register R i Earliest/latest arrival times a i, A i Earliest/latest departure times d i, D i Clock signal delay t i

Clock Period Minimization Problem - 2 Problem Parameters –For each register R i Clock-to-output delay D CQ Data-to-output D DQ Setup time S i Hold time H i –For each local data path R i  R j Data propagation time D P if

Practical Causes of Clock Skew Size Mismatches –Buffer Size, Interconnect length Process Variations –L eff, T ox etc. Temperature Gradients Power Supply Voltage Drop