Pattern Sensitive Placement For Manufacturability Shiyan Hu, Jiang Hu Shiyan Hu, Jiang Hu Department of Electrical and Computer Engineering Department of Electrical and Computer Engineering Texas A&M University Texas A&M University College Station, TX, 77843 College Station, TX, 77843
46
Embed
Pattern Sensitive Placement For Manufacturability Shiyan Hu, Jiang Hu Department of Electrical and Computer Engineering Texas A&M University College Station,
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Pattern Sensitive Placement For Manufacturability
Pattern Sensitive Placement For Manufacturability
Shiyan Hu, Jiang HuShiyan Hu, Jiang Hu
Department of Electrical and Computer EngineeringDepartment of Electrical and Computer Engineering
Texas A&M UniversityTexas A&M University
College Station, TX, 77843College Station, TX, 77843
2
OutlineOutline
Lithography systemLithography system MotivationMotivation Problem formulationProblem formulation AlgorithmsAlgorithms Experimental resultsExperimental results ConclusionConclusion
3
Lithography ProcessLithography Process
oxidation
opticalmask
processstep
photoresist coatingphotoresistremoval (ashing)
spin, rinse, dryacid etch
photoresist
stepper exposure
development
Typical operations in a single photolithographic cycle (from [Fullman]).
Limited capacity and increasingly Limited capacity and increasingly difficultdifficultExpensive mask costExpensive mask cost
OPC
8
Design For Manufacturability (DFM)Design For Manufacturability (DFM)
Efforts are needed in all design and Efforts are needed in all design and process stages.process stages.
Physical design considering Physical design considering printability: Design For printability: Design For Manufacturability (DFM). Manufacturability (DFM). – To make RET easier and cheaper To make RET easier and cheaper
to applyto apply
9
Previous Works on DFMPrevious Works on DFM
Regular fabric: Regular fabric: – Introduce regular geometry, similar to FPGAIntroduce regular geometry, similar to FPGA– Compromised performanceCompromised performance
Restricted design rules:Restricted design rules:– Not able to accurately capture lithography effectsNot able to accurately capture lithography effects– Rule explosion: 2000 pages in 22nm technologyRule explosion: 2000 pages in 22nm technology
(From DAC’05)
Previous Works on DFMPrevious Works on DFM
Regular fabric: Regular fabric: – Introduce regular geometry, similar to FPGAIntroduce regular geometry, similar to FPGA– Compromised performanceCompromised performance
Restricted design rules:Restricted design rules:– Not able to accurately capture lithography effectsNot able to accurately capture lithography effects– Rule explosion: 2000 pages in 22nm technologyRule explosion: 2000 pages in 22nm technology
RET-friendly detailed placement (ASPDAC’05):RET-friendly detailed placement (ASPDAC’05):– Small spacing perturbationSmall spacing perturbation– No cell flipping, no cell relocationNo cell flipping, no cell relocation
Cell PlacementCell Placement– Given a circuit, decide the physical location of each Given a circuit, decide the physical location of each
gategate– A major step in the physical layout design flowA major step in the physical layout design flow– Objectives: small wirelength, small area, good Objectives: small wirelength, small area, good
timing, etc.timing, etc. Placement
12
This WorkThis Work
Post-placement optimization for Post-placement optimization for printabilityprintability– Post-placement optimizationPost-placement optimization
Applicable to any existing placement to Applicable to any existing placement to make it easier to printmake it easier to print
Limit modification to retain benefitsLimit modification to retain benefits– Improve printabilityImprove printability
Measurement of printabilityMeasurement of printability How? How?
– Relocation and FlippingRelocation and Flipping
13
Measurement of PrintabilityMeasurement of Printability
Slope (ILS), process window,…Slope (ILS), process window,…: EPE: EPE
From http://www.vlsitechnology.org/
14
Our Optimization
Existing Placer
Relocation and FlippingRelocation and Flipping
Hard to print by
simulation
Easy to print by
simulation
15
Cell Flipping to Improve PrintabilityCell Flipping to Improve Printability
50% reduction in gate length deviation
From http://www.vlsitechnology.org/
16
Our ApproachOur Approach
Offline:Offline:– For each possible For each possible
pattern formed by pattern formed by two cells, assign a two cells, assign a manufacturability manufacturability costcost Accurate Accurate
lithography lithography simulationssimulations
Results saved Results saved in a lookup in a lookup tabletable
Online:Online:– Prefer easy-to-Prefer easy-to-
print patterns in print patterns in designdesign
Pattern: part between horizontally adjacent cell horizontally adjacent cell pairpair
From http://www.vlsitechnology.org/
17
Problem FormulationProblem Formulation
Given a cell placementGiven a cell placement Perform post-processing optimizations, Perform post-processing optimizations,
which can be cell flipping and which can be cell flipping and relocationrelocation
Total manufacturability cost (sum of Total manufacturability cost (sum of manufacturability cost over all manufacturability cost over all patterns) is reduced subject to the patterns) is reduced subject to the modification (wire length) constraint.modification (wire length) constraint.
The algorithm is for row-based layout.The algorithm is for row-based layout. Perform optimization row by row.Perform optimization row by row. For each row of cells, perform the dynamic For each row of cells, perform the dynamic
Solution 1 is Solution 1 is inferiorinferior if if – CE1 > CE2 : larger cumulative CE1 > CE2 : larger cumulative
manufacturability costmanufacturability cost– and CW1 > CW2 : larger cumulative and CW1 > CW2 : larger cumulative
wirelengthwirelength Whenever a solution becomes inferior, it is Whenever a solution becomes inferior, it is
pruned.pruned.
22
Single Row OptimizationSingle Row Optimization
Allow both cell flipping and cell relocation.Allow both cell flipping and cell relocation. Partition a row of cells into groups.Partition a row of cells into groups. Small modification Small modification a cell movable only within a a cell movable only within a
group. group.
23
Flow for Single Row OptimizationFlow for Single Row Optimization
Partition a row of cells into groups
Pick groups for optimization
Perform group optimization tentatively
Accept the result if printability is improved and overhead satisfies
constraint
Difficult
24
Group OptimizationGroup Optimization
Compute the placement with best manufacturability cost (no wirelength
constraint)
Compute the placement with best wirelength (initial placement)
Tradeoff: gradually tune best manufacturability placement towards the
best wirelength placement
Difficult
Difficult
25
Placement with Best Manufacturability CostPlacement with Best Manufacturability Cost
: 0
: manufacturability cost
26
Placement with Best Manufacturability CostPlacement with Best Manufacturability Cost
: 0
: manufacturability cost
27
Placement with Best Manufacturability CostPlacement with Best Manufacturability Cost
: 0
: manufacturability cost
28
Placement with Best Manufacturability CostPlacement with Best Manufacturability Cost
: 0
: manufacturability cost
Flipped
29
Placement with Best Manufacturability CostPlacement with Best Manufacturability Cost
: 0
: manufacturability cost
30
Placement with Best Manufacturability CostPlacement with Best Manufacturability Cost
: 0
: manufacturability cost
Every placement
corresponds to a Hamiltonian
path
31
Minimum Cost Hamiltonian Path ProblemMinimum Cost Hamiltonian Path Problem
The placement with best manufacturability The placement with best manufacturability cost cost the minimum cost Hamiltonian Path the minimum cost Hamiltonian Path – No wirelength constraintNo wirelength constraint
Well-known NP-hard problemWell-known NP-hard problem Closest point heuristic is usedClosest point heuristic is used
Start from best manufacturability solution Gradually adjust it to satisfy wirelength
constraint
A B C D E
B A E D C
Best Manufacturability
Best Wire
Reduce crossings: Reduce crossings: fewer crossings fewer crossings closer to closer to best wire solution best wire solution possible to satisfy the possible to satisfy the wirelength constraintwirelength constraint
Start from best manufacturability solution Gradually adjust it to satisfy wirelength
constraint
A B E D C
B A E D CBest Wire
Able to get the solution with good Able to get the solution with good manufacturability cost satisfying the wirelength manufacturability cost satisfying the wirelength constraintconstraint
35
Multiple Row Based OptimizationMultiple Row Based Optimization
MotivationMotivation– A net often spans adjacent rowsA net often spans adjacent rows– Moving cells in different rows simultaneously Moving cells in different rows simultaneously
may reduce wirelengthmay reduce wirelength– Some previously “infeasible” Some previously “infeasible”
manufacturability-driven placement may manufacturability-driven placement may become “feasible”. More options.become “feasible”. More options.
Propose three algorithms for pattern sensitive placement for manufacturability: – Cell Flipping only– Single Row Optimization– Multiple Row Optimization
>20% edge placement error reduction. <1% wire length overhead. Runtime acceptable for large placement