prev
next
out of 9

KLMH

Embed Size (px)

Citation preview

  • 8/18/2019 KLMH

    1/9

    P =

    1819.714 : 3.141593 = 1.3 * 0.02 * 32 +

    579.233 = 0.832 + 132 + 0.99 *

    579.233 2409 R

    R = 2.039

    R2

    R2

    R2

  • 8/18/2019 KLMH

    2/9

  • 8/18/2019 KLMH

    3/9

    4 * 1.65 * 20 + 0.6 * 1.65 * R * 18

    R * 18

  • 8/18/2019 KLMH

    4/9

  • 8/18/2019 KLMH

    5/9

  • 8/18/2019 KLMH

    6/9

  • 8/18/2019 KLMH

    7/9

  • 8/18/2019 KLMH

    8/9

  • 8/18/2019 KLMH

    9/9


© KLMH Lienig Multi-Threaded Collision Aware Global Routing Bounded Length Maze Routing

© KLMH Lienig Multi-Threaded Collision Aware Global Routing Bounded Length Maze Routing

Documents
Chapter 5 –Global Routing - University of Michiganvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter5/chap... · 2011-12-06 · (Chap. 8) Power (VDD) and Ground (GND) routing (Chap

Chapter 5 –Global Routing - University of Michiganvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter5/chap... · 2011-12-06 · (Chap. 8) Power (VDD) and Ground (GND) routing (Chap

Documents
,J ]e w 7. 0 o - Wing On Travel · 2017-03-21 · FU=K~C;aTlU=K~;^IILMYlV5}rhKDKqweI9YF*zEU?N~lME:+*V~}82?R+4V~}7Ur>U_g`Xbb?n klmh ~XeL+et|/ksN^f;~;;eR7;b|x1{jf;}>E; ... NC 1_ke[sC;@YLn

,J ]e w 7. 0 o - Wing On Travel · 2017-03-21 · FU=K~C;aTlU=K~;^IILMYlV5}rhKDKqweI9YF*zEU?N~lME:+*V~}82?R+4V~}7Ur>U_g`Xbb?n klmh ~XeL+et|/ksN^f;~;;eR7;b|x1{jf;}>E; ... NC 1_ke[sC;@YLn

Documents
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 2: Netlist and System Partitioning © KLMH Lienig 1 Chapter 2 – Netlist and System

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 2: Netlist and System Partitioning © KLMH Lienig 1 Chapter 2 – Netlist and System

Documents
Chapter 2 – Netlist and System Partitioningvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter2/chap2-110920.pdf2.4.1 Kernighan-Lin (KL) Algorithm 2.4.2 Extensions of the Kernighan-Lin

Chapter 2 – Netlist and System Partitioningvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter2/chap2-110920.pdf2.4.1 Kernighan-Lin (KL) Algorithm 2.4.2 Extensions of the Kernighan-Lin

Documents
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 7: Specialized Routing © KLMH Lienig Chapter 7 – Specialized Routing VLSI Physical

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 7: Specialized Routing © KLMH Lienig Chapter 7 – Specialized Routing VLSI Physical

Documents
Chapter 6 –Detailed Routing - University of Michiganvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter6/chap6-11120… · VLSI Physical Design: From Graph Partitioning to Timing

Chapter 6 –Detailed Routing - University of Michiganvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter6/chap6-11120… · VLSI Physical Design: From Graph Partitioning to Timing

Documents
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 3: Chip Planning © KLMH Lienig 1 Modern Floorplanning Based on B*-Tree and Fast

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 3: Chip Planning © KLMH Lienig 1 Modern Floorplanning Based on B*-Tree and Fast

Documents
Chapter 5 –Global Routingvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter5/chap5-1303… · 4 5 6 Netlist: N 1 = {C 4, D 6, B 3} N 2 = {D 4, B 4, C 1, A 4} N 3 = {C 2, D 5} N

Chapter 5 –Global Routingvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter5/chap5-1303… · 4 5 6 Netlist: N 1 = {C 4, D 6, B 3} N 2 = {D 4, B 4, C 1, A 4} N 3 = {C 2, D 5} N

Documents
VLSI Physical Design: From Graph Partitioning to Timing Closure Paper Presentation © KLMH Lienig 1 EECS 527 Paper Presentation Topological Design of Clock

VLSI Physical Design: From Graph Partitioning to Timing Closure Paper Presentation © KLMH Lienig 1 EECS 527 Paper Presentation Topological Design of Clock

Documents
Chapter 7 –Specialized · PDF fileVLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 7: Specialized Routing ©KLMH Lienig 3 ENTITY test is port a: in bit; end

Chapter 7 –Specialized · PDF fileVLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 7: Specialized Routing ©KLMH Lienig 3 ENTITY test is port a: in bit; end

Documents
Chapter 5 –Global Routing - University of Michiganvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter5/chap5-130517.pdf · VLSI Physical Design: From Graph Partitioning to Timing

Chapter 5 –Global Routing - University of Michiganvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter5/chap5-130517.pdf · VLSI Physical Design: From Graph Partitioning to Timing

Documents
Chapter 3 –Chip PlanningVLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 3: Chip Planning ©KLMH 20 Lienig • Create nodes for every block. • In addition,

Chapter 3 –Chip PlanningVLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 3: Chip Planning ©KLMH 20 Lienig • Create nodes for every block. • In addition,

Documents
Chapter 4 – Global and Detailed Placementvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter4/chap4-111206.pdfVLSI Physical Design: From Graph Partitioning to Timing Closure Chapter

Chapter 4 – Global and Detailed Placementvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter4/chap4-111206.pdfVLSI Physical Design: From Graph Partitioning to Timing Closure Chapter

Documents
Chapter 3 –Chip Planning - University of Michiganvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter… ·  · 2013-07-01Module e I/O Pads Block Pins Block a Block b Block d Block

Chapter 3 –Chip Planning - University of Michiganvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter… ·  · 2013-07-01Module e I/O Pads Block Pins Block a Block b Block d Block

Documents
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 8: Timing Closure © KLMH Lienig 1 Chapter 8 – Timing Closure VLSI Physical Design:

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 8: Timing Closure © KLMH Lienig 1 Chapter 8 – Timing Closure VLSI Physical Design:

Documents
Chapter 3 –Chip Planningvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter3/chap3-1109… · VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 3: Chip Planning

Chapter 3 –Chip Planningvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter3/chap3-1109… · VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 3: Chip Planning

Documents
Chapter 3 –Chip Planning - University of Michiganvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter3/chap3-orig.… · VLSI Physical Design: From Graph Partitioning to Timing Closure

Chapter 3 –Chip Planning - University of Michiganvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter3/chap3-orig.… · VLSI Physical Design: From Graph Partitioning to Timing Closure

Documents
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 1: Introduction © KLMH Lienig 1 Chapter 1 – Introduction 1.1Electronic Design Automation

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 1: Introduction © KLMH Lienig 1 Chapter 1 – Introduction 1.1Electronic Design Automation

Documents
© KLMH Lienig 1 Chapter 1 – Introduction Original Authors: Andrew B. Kahng, Jens Lienig, Igor L. Markov, Jin Hu VLSI Physical Design: From Graph Partitioning

© KLMH Lienig 1 Chapter 1 – Introduction Original Authors: Andrew B. Kahng, Jens Lienig, Igor L. Markov, Jin Hu VLSI Physical Design: From Graph Partitioning

Documents
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 4: Global and Detailed Placement © KLMH Lienig 1 Chapter 4 – Global and Detailed

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 4: Global and Detailed Placement © KLMH Lienig 1 Chapter 4 – Global and Detailed

Documents
Chapter 8 –Timing Closure - University of Michiganvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter8/chap8-orig.pdf · VLSI Physical Design: From Graph Partitioning to Timing Closure

Chapter 8 –Timing Closure - University of Michiganvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter8/chap8-orig.pdf · VLSI Physical Design: From Graph Partitioning to Timing Closure

Documents
Chapter 1 –Introductionvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter... · VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 1: Introduction 14 ©KLMH

Chapter 1 –Introductionvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter... · VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 1: Introduction 14 ©KLMH

Documents
Chapter 8 –Timing Closure - University of Michiganvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter... · VLSI Physical Design: ... 8.3.2 Embedding STA into Linear Programs for

Chapter 8 –Timing Closure - University of Michiganvlsicad.eecs.umich.edu/KLMH/downloads/book/chapter... · VLSI Physical Design: ... 8.3.2 Embedding STA into Linear Programs for

Documents
LMMQM08M X 385 · iqT2aC?\^\] ]]]\ ab`c_hmghmgjhin spteterqpekoluusfk @DL yzz{zpqzo} _OeT]OJu Vo,opzo|qoO[}|u ^}|u KLMH ^4nODR5Z2eWr,bY-DOo2Ej+D.4xQ}D_OeT]D>0F\ eWr,bo`Y-DG+J?N\>p

LMMQM08M X 385 · iqT2aC?\^\] ]]]\ ab`c_hmghmgjhin spteterqpekoluusfk @DL yzz{zpqzo} _OeT]OJu Vo,opzo|qoO[}|u ^}|u KLMH ^4nODR5Z2eWr,bY-DOo2Ej+D.4xQ}D_OeT]D>0F\ eWr,bo`Y-DG+J?N\>p

Documents
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig © 2011 Springer Verlag 1 Chapter 5 – Global Routing

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig © 2011 Springer Verlag 1 Chapter 5 – Global Routing

Documents
Chapter 1 –IntroductionVLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 1: Introduction 15 ©KLMH Lienig 1.4 Layout Layers and Design Rules • Size rules

Chapter 1 –IntroductionVLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 1: Introduction 15 ©KLMH Lienig 1.4 Layout Layers and Design Rules • Size rules

Documents
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 6: Detailed Routing © KLMH Lienig 1 Chapter 6 – Detailed Routing Original Authors:

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 6: Detailed Routing © KLMH Lienig 1 Chapter 6 – Detailed Routing Original Authors:

Documents
Chapter 8 –Timing Closurevlsicad.eecs.umich.edu/KLMH/downloads/book/chapter8/chap8-1303… · VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 8: Timing Closure

Chapter 8 –Timing Closurevlsicad.eecs.umich.edu/KLMH/downloads/book/chapter8/chap8-1303… · VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 8: Timing Closure

Documents
Chapter 7 –Specialized Routing - vlsicad pagevlsicad.eecs.umich.edu/KLMH/downloads/book/chapter7/chap...VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 7:

Chapter 7 –Specialized Routing - vlsicad pagevlsicad.eecs.umich.edu/KLMH/downloads/book/chapter7/chap...VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 7:

Documents