About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISQED 2008
Conference paper
A randomized greedy algorithm for the pattern fill problem for DFM applications
Abstract
This work deals with the dummy fill and negative fill insertion problem with constraints on the minimum and maximum pattern density within a moving rectangular window. It is shown that the general class of such problems is at least NP-hard. A greedy randomized algorithm for this problem is proposed, and its proof of convergence and some experimental results are presented. More detailed account of our implementation and results are available in [7]. © 2008 IEEE.