novel pulsed latch replacement based on time borrowing
play

Novel Pulsed-Latch Replacement Based on Time Borrowing and Spiral - PowerPoint PPT Presentation

Novel Pulsed-Latch Replacement Based on Time Borrowing and Spiral Clustering C HIH -L ONG C HANG I RIS H UI -R U J IANG Y U -M ING Y ANG NCTU E VAN Y U -W EN T SAI A KI S HENG -H UA C HEN IRIS Lab National Chiao Tung University Outline 2


  1. Novel Pulsed-Latch Replacement Based on Time Borrowing and Spiral Clustering C HIH -L ONG C HANG I RIS H UI -R U J IANG Y U -M ING Y ANG NCTU E VAN Y U -W EN T SAI A KI S HENG -H UA C HEN IRIS Lab National Chiao Tung University

  2. Outline 2 Introduction Introduction Preliminaries Preliminaries Feasible region Feasible region Algorithm Algorithm Experimental results Experimental results Conclusion Conclusion PL - ISPD'12

  3. Clock Power Dominates! 3  Clock power is the major contributor of total chip power consumption  Large portion of it is consumed by sequencing elements  Minimize the sequencing overhead! D Q D Q Comb ckt … clock clk clk power … 27% Clock network C clk Power breakdown of an ASIC Chen et al . Using multi-bit flip-flop for clock power Clock root saving by DesignCompiler. SNUG , 2010. PL - ISPD'12

  4. Flip-Flops vs. Pulsed-Latches 4  Flip-flop (FF)  The most common form of sequencing elements  Two cascaded latches triggered by a clock signal  High sequencing overhead in terms of delay, power, area  Pulsed-latch (PL)  A latch synchronized by a pulse clock  A PL can be approximated as a fast, low-power, and small FF  Promising to reduce power for high performance circuits  Migrate from a FF-based design to a PL-based counterpart to reduce the sequencing overhead Pulsed-latch Flip-flop L clk PG clk Delay L Master Slave Q D latch latch PG: pulse generator w PL - ISPD'12 L: Latch

  5. Prior Work Generic PL L PG clk 5  Most of previous works adopt the generic PL structure L and flip-flop-like timing analysis  Pulse distortion Chuang et al. [DAC’10] propose a PL-aware analytical placer, 1. controlling pulse distortion by limiting the # of PLs and total WL driven by each PG (no timing consideration)  Timing Lee et al. [ICCAD’08], Lee et al. [ICCAD’09] and Paik et al. 2. [ASPDAC’10] apply aggressive time borrowing techniques (clock skew scheduling, pulse width allocation, retiming)  Power Shibatani and Li [EETimes’06] propose a methodology 3. Kim et al. [ASPDAC’11] generate clock gating functions of PGs 4. Lin et al. [ISLPED’11] minimize # of PGs without considering 5. clock gating Chuang et al. [ICCAD’11] perform placement and clock network 6. co-synthesis (based on 1 and 5) PL - ISPD'12

  6. Multi-bit Pulsed-Latches (1/2) load 6  The generic PL structure  Pulses can easily be distorted since the PG and latches are placed apart  Multi-bit pulsed-latches Time (ns)  The PG and latches are placed and hard-wired together in a compact and symmetric form  The pulse distortion and clock skew can be well controlled L L L PG clk clk PG L L L Generic pulsed latch: Multi-bit pulsed latch: pulse generator (PG) and latches (L) hardwired PG and L together Chuang et al. Pulsed-latch-aware placement for timing-integrity optimization. DAC-10. Farmer, et al. Pipeline array. US patent 6856270 B1, 2005. PL - ISPD'12 Venkatraman et al., “A robust, fast pulsed flip-flop design,” GLSVLSI-08.

  7. Multi-bit Pulsed-Latches (2/2) 7  Multi-bit pulsed-latches are more power efficient than single-bit pulsed latch. Bit Number Normalized power per bit 1 1.000 2 0.740 4 0.613 8 0.575 L L clk PG L L Multi-bit pulsed latch: hardwired PG and L together PL - ISPD'12

  8. Do We Need Aggressive Time Borrowing? 8  Under flip-flop-like timing analysis, prior works use aggressive time borrowing techniques  Various pulse widths, clock skew scheduling, and retiming may induce some difficulties on timing closure and functional verification  Latches have the time borrowing property  STA tools are mature to handle time borrowing  The amount of time borrowing offered by the pulse width is significant for high performance circuits  We can utilize only the intrinsic time borrowing of latches to provide flexibility to relocate pulsed-latches PL - ISPD'12

  9. How About MBPL Replacement? 9  Based on the multi-bit pulsed-latch structure and time borrowing offered by the pulse width, we apply post-placement pulsed-latch replacement to minimize power consumption subject to timing constraints. 1 1 1 L 2 2 2 L L L L PG L L 3 3 3 L Feasible PG region with L L L time L borrowing 4 4 4 Generic pulsed latches MBPL without MBPL with without time borrowing time borrowing time borrowing PL - ISPD'12 may incur pulse distortion

  10. Our Contributions 10 Since clock gating is widely used for clock power reduction, we incorporate clock gating Clock consideration into pulsed-latch gating replacement to gain double patterns benefits from clock gating and pulsed-latch. Spiral Spiral clustering method is suitable for not only clustering rectangular but also Irregular rectilinear shaped layouts; feasible the latter are popular in regions modern IC design due to macros. We derive timing analysis formulae with time borrowing consideration and reveal that the feasible regions can be very irregular. We adopt an efficient representation to manipulate them. PL - ISPD'12

  11. Outline 11 Introduction Introduction Preliminaries Preliminaries Feasible region Feasible region Algorithm Algorithm Experimental results Experimental results Conclusion Conclusion PL - ISPD'12

  12. The Pulsed-Latch Migration Flow 12  We replace flip-flops by multi-bit pulsed-latches based on their timing slacks and the available amount of time borrowing. Flip-flop-based Post-placement logic synthesis MBPL replacement Placement Placement legalization Flip-flop-based Pulsed-latch-based timing analysis timing analysis Meet Clock-gating-aware Y N timing ? clock tree synthesis Routing PL - ISPD'12

  13. Problem Formulation 13  The Multi-Bit Pulsed-Latch Replacement problem:  Given  A multi-bit pulsed-latch library  Nelist & placement of a design  The timing slacks  Clock gating patterns of flip-flops  Goal  Replace flip-flops by multi-bit pulsed-latches with time borrowing  Minimize power on pulsed-latches  Subject to timing slack and placement density constraints PL - ISPD'12

  14. Outline 14 Introduction Introduction Preliminaries Preliminaries Feasible region Feasible region Algorithm Algorithm Experimental results Experimental results Conclusion Conclusion PL - ISPD'12

  15. Timing Analysis – Flip-flops 15  Flip-flop Max: D ij Max: D jk i j k t fo (i) Min: d ij t fi (j) t fo (j) Min: d jk t fi (k) clock T T  Setup  Hold PL - ISPD'12

  16. Timing Analysis – Pulsed-latches (1/2) 16  Pulsed-latch Max: D ij Max: D jk i j k t fo (i) Min: d ij t fi (j) t fo (j) Min: d jk t fi (k) clock T T w  When we replace flip-flops with pulsed-latches, the data can depart the launching latch on the rising edge of the clock, but does not have to set up until the falling edge of the clock on the receiving latch.  If the maximum delay from i to j exceeds a cycle period, it can borrow time from the delay from j to k. PL - ISPD'12

  17. Timing Analysis – Pulsed-latches (2/2) 17  Pulsed-latch Max: D ij Max: D jk i j k t fo (i) Min: d ij t fi (j) t fo (j) Min: d jk t fi (k) clock T T w  Setup  Hold  To guarantee successful time borrowing, in this paper, time borrowing is allowed between two adjacent timing windows PL - ISPD'12

  18. Timing Slack Conversion 18  Flip-flop-based synthesis and placement have considered the extra hold time margin w  we focus on setup slacks Max: D ij i j t fo (i) Min: d ij t fi (j) T  Convert the timing slacks for and obtained by flip- flop-based timing analysis into pulsed-latch-based slacks without time borrowing  We equally distribute the whole setup slacks to the latches’ fanin and fanout parts PL - ISPD'12

  19. Slack vs. Wirelength 19  Based on Synopsys' Liberty library, wire delays and can be approximated by piece-wise linear functions with the Manhattan distances and Max: D ij i j t fo (i) Min: d ij t fi (j) is calibrated by the delay table of the pulsed-latch library   We incorporate time borrowing into the slack value to derive feasible regions PL - ISPD'12

  20. Feasible Region with Time Borrowing (1/3) 20 i j k t fo (i) t fi (j) t fo (j) t fi (k) Feasible region without time borrowing The fanin and fanout setup time slacks define two diamonds S fo (j)/  centered at the fanin and fanout S fi (j)/  gates of pulsed-latch j . The overlap area is the initial Fanout feasible region without time Fanin borrowing. Fanin diamond Fanout diamond PL - ISPD'12

  21. Feasible Region with Time Borrowing (2/3) 21  t b : the amount of time borrowed from the timing window j-k to window i-j , t b  w Feasible region t b /  without time borrowing When we borrow some time t b , the fanin diamond is expanded S fo (j)/  by t b /  , while the fanout diamond S fi (j)/  is shrunk by t b /  . t b /  The overlap area slides Fanout horizontally or vertically. Fanin Feasible region with time borrowing t b PL - ISPD'12

  22. Feasible Region with Time Borrowing (3/3) 22  t b : the amount of time borrowed from the timing window j-k to window i-j , t b  w Fanout When we keep borrowing, the fanin or fanout diamond would S fo (j)/  reach the middle lines of the S fi (j)/  boundaries of fanin/fanout diamonds, and the overlap area are truncated. The entire feasible region is Fanin irregular. In the worst case, the feasible Entire feasible region region could be an octagon. with time borrowing PL - ISPD'12

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend