Proceedings of the 46th Annual Design Automation Conference 2009
DOI: 10.1145/1629911.1630052
|View full text |Cite
|
Sign up to set email alerts
|

Provably good and practically efficient algorithms for CMP dummy fill

Abstract: Abstract-To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous researches formulated the dummy fill problem as a standard Linear Program (LP). However, solving the huge linear program formed by real-life designs is very expensive and has become the hurdle in deploying the technology. Even though there exist efficient heuristics, their performance cannot be guaranteed. In this paper, we develop a dum… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 12 publications
0
6
0
Order By: Relevance
“…The designer didn't have any control on the result and this was clearly a blocking point to reach the expected performances of the chip. The flow that has been put in place uses another tool with a significantly different algorithm compared to what is commonly used [4,5]. The results were the ones expected by the designers, both in terms of layout and in terms of efficiency.…”
Section: Qualitymentioning
confidence: 78%
“…The designer didn't have any control on the result and this was clearly a blocking point to reach the expected performances of the chip. The flow that has been put in place uses another tool with a significantly different algorithm compared to what is commonly used [4,5]. The results were the ones expected by the designers, both in terms of layout and in terms of efficiency.…”
Section: Qualitymentioning
confidence: 78%
“…One such improvement is developed in [30]. The LP approaches discussed above typically have 𝑂(( 𝑛𝑟 𝑤 ) 2 ) complexity w.r.t the number of variables and constraints thereby making it prohibitive on large layout sizes.…”
Section: Discussionmentioning
confidence: 99%
“…The LP approaches discussed above typically have 𝑂(( 𝑛𝑟 𝑤 ) 2 ) complexity w.r.t the number of variables and constraints thereby making it prohibitive on large layout sizes. [30] proposes a covering linear program (CLP) based formulation wherein the density upper bounds are applied to the tiles instead of the windows. Such an approach lends itself amenable to the more efficient Fully Polynomial Time Approximation Scheme (FPTAS) algorithm [31].…”
Section: Discussionmentioning
confidence: 99%
“…The performance of CMP is highly related to the layout density of a given window, and uniform density distribution contributes to high CMP quality [7]. In other words, density variation along windows is very critical, which is also the purpose of introducing dummy fills.…”
Section: Layout Densitymentioning
confidence: 99%
“…As the advancement of technology node, circuits become larger and larger that LP-based method reaches their limitation due to problem sizes. In both [1] and [7], analysis of an example layout with 200µm×200µm windows results in over 160K variables, thus the runtime becomes the bottleneck for LP-based method. Alternative approaches based on Monte Carlo or heuristic algorithms have been proposed.…”
Section: Introductionsmentioning
confidence: 99%