Item Details

Print View

Practical Iterated Fill Synthesis for CMP Uniformity

Chen, Yu; Kahng, Andrew; Robins, Gabriel; Zelikovsky, Alexander
Format
Report
Author
Chen, Yu
Kahng, Andrew
Robins, Gabriel
Zelikovsky, Alexander
Abstract
We propose practical iterated methods for layout density control for CMP uniformity, based on linear programming, Monte-Carlo and greedy algorithms. We experimentally study the tradeoffs between two main filling objectives: minimizing density variation, and min- imizing the total amount of inserted fill. Comparisons with previ- ous filling methods show the advantages of our new iterated Monte- Carlo and iterated greedy methods. We achieve near-optimal filling with respect to each of the objectives and for both density models (spatial density and effective density). Our new methods are more efficient in practice than in linear programming and more accurate than non-iterated Monte-Carlo approaches.
Language
English
Date Received
2012-10-29
Published
University of Virginia, Department of Computer Science, 2000
Published Date
2000
Collection
Libra Open Repository
In CopyrightIn Copyright
▾See more
▴See less

Availability

Access Online