Closing the Smoothness and Uniformity Gap in Area Fill Synthesis

Slides:



Advertisements
Similar presentations
Hierarchical Dummy Fill for Process Uniformity Supported by Cadence Design Systems, Inc. NSF, and the Packard Foundation Y. Chen, A. B. Kahng, G. Robins,
Advertisements

New Graph Bipartizations for Double-Exposure, Bright Field Alternating Phase-Shift Mask Layout Andrew B. Kahng (UCSD) Shailesh Vaya (UCLA) Alex Zelikovsky.
1 LP Duality Lecture 13: Feb Min-Max Theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum.
Ispd-2007 Repeater Insertion for Concurrent Setup and Hold Time Violations with Power-Delay Trade-Off Salim Chowdhury John Lillis Sun Microsystems University.
Timing Margin Recovery With Flexible Flip-Flop Timing Model
Online Scheduling with Known Arrival Times Nicholas G Hall (Ohio State University) Marc E Posner (Ohio State University) Chris N Potts (University of Southampton)
Multi-Project Reticle Floorplanning and Wafer Dicing Andrew B. Kahng 1 Ion I. Mandoiu 2 Qinke Wang 1 Xu Xu 1 Alex Zelikovsky 3 (1) CSE Department, University.
Efficiency concerns in Privacy Preserving methods Optimization of MASK Shipra Agrawal.
© Yamacraw, 2001 Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability A. Zelikovsky GSU Joint work with C. Alpert.
Minimum-Buffered Routing of Non- Critical Nets for Slew Rate and Reliability Control Supported by Cadence Design Systems, Inc. and the MARCO Gigascale.
Background: Scan-Based Delay Fault Testing Sequentially apply initialization, launch test vector pairs that differ by 1-bit shift A vector pair induces.
Monte-Carlo Methods for Chemical-Mechanical Planarization on Multiple-Layer and Dual-Material Models Supported by Cadence Design Systems, Inc., NSF, the.
Placement of Integration Points in Multi-hop Community Networks Ranveer Chandra (Cornell University) Lili Qiu, Kamal Jain and Mohammad Mahdian (Microsoft.
Performance-Impact Limited Area Fill Synthesis
Fill for Shallow Trench Isolation CMP
1 Nicholas Mancuso Department of Computer Science Georgia State University Joint work with Bassam Tork, GSU Pavel Skums, CDC Ion M ӑ ndoiu, UConn Alex.
ABSTRACT We consider the problem of buffering a given tree with the minimum number of buffers under load cap and buffer skew constraints. Our contributions.
Study of Floating Fill Impact on Interconnect Capacitance Andrew B. Kahng Kambiz Samadi Puneet Sharma CSE and ECE Departments University of California,
Practical Iterated Fill Synthesis for CMP Uniformity Supported by Cadence Design Systems, Inc. Y. Chen, A. B. Kahng, G. Robins, A. Zelikovsky (UCLA, UVA.
Optical flow and Tracking CISC 649/849 Spring 2009 University of Delaware.
DPIMM-03 1 Performance-Impact Limited Area Fill Synthesis Yu Chen, Puneet Gupta, Andrew B. Kahng (UCLA, UCSD) Supported by Cadence.
Fill for Shallow Trench Isolation CMP Andrew B. Kahng 1,2 Puneet Sharma 1 Alexander Zelikovsky 3 1 ECE Department, University of California – San Diego.
UC San Diego Computer Engineering VLSI CAD Laboratory UC San Diego Computer Engineering VLSI CAD Laboratory UC San Diego Computer Engineering VLSI CAD.
A Proposal for Routing-Based Timing-Driven Scan Chain Ordering Puneet Gupta 1 Andrew B. Kahng 1 Stefanus Mantik 2
1 University of Denver Department of Mathematics Department of Computer Science.
Border Length Minimization in DNA Array Design A.B. Kahng, I.I. Mandoiu, P.A. Pevzner, S. Reda (all UCSD), A. Zelikovsky (GSU)
1 Area Fill Generation With Inherent Data Volume Reduction Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky and Yuhong Zheng (UCLA, UCSD,
UC San Diego Computer Engineering. VLSI CAD Laboratory.. UC San Diego Computer EngineeringVLSI CAD Laboratory.. UC San Diego Computer EngineeringVLSI CAD.
Hierarchical Dummy Fill for Process Uniformity Supported by Cadence Design Systems, Inc. Y. Chen, A. B. Kahng, G. Robins, A. Zelikovsky (UCLA, UCSD, UVA.
RLC Interconnect Modeling and Design Students: Jinjun Xiong, Jun Chen Advisor: Lei He Electrical Engineering Department Design Automation Group (
Abstract A new Open Artwork System Interchange Standard (OASIS) has been recently proposed for replacing the GDSII format. A primary objective of the new.
1 Less is More? Yi Wu Advisor: Alex Rudnicky. 2 People: There is no data like more data!
Hierarchical Dummy Fill for Process Uniformity Supported by Cadence Design Systems, Inc. NSF, and the Packard Foundation Y. Chen, A. B. Kahng, G. Robins,
6. Experimental Analysis Visible Boltzmann machine with higher-order potentials: Conditional random field (CRF): Exponential random graph model (ERGM):
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
NTUEE 1 Coupling-Constrained Dummy Fill for Density Gradient Minimization Huang-Yu Chen 1, Szu-Jui Chou 2, and Yao-Wen Chang 1 1 National Taiwan University,
On Energy-Efficient Trap Coverage in Wireless Sensor Networks Junkun Li, Jiming Chen, Shibo He, Tian He, Yu Gu, Youxian Sun Zhejiang University, China.
Closing the Smoothness and Uniformity Gap in Area Fill Synthesis Supported by Cadence Design Systems, Inc., NSF, the Packard Foundation, and State of Georgia’s.
Scalable Symbolic Model Order Reduction Yiyu Shi*, Lei He* and C. J. Richard Shi + *Electrical Engineering Department, UCLA + Electrical Engineering Department,
 Chemical-Mechanical Polishing (CMP)  Rotating pad polishes each layer on wafers to achieve planarized surfaces  Uneven features cause polishing pad.
1 On Completing Latin Squares Iman Hajirasouliha Joint work with Hossein Jowhari, Ravi Kumar, and Ravi Sundaram.
1 Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2  1000 (Plastic) 3X 1 + 4X 2  2400 (Production Time) X 1 + X 2  700 (Total production) X 1.
Reporter: An-Chien Wu Date: 2005/05/19 Place: HR2 ROOM 306
T. Messelis, S. Haspeslagh, P. De Causmaecker B. Bilgin, G. Vanden Berghe.
Duy & Piotr. How to reconstruct a high quality image with the least amount of samples per pixel the least amount of resources And preserving the image.
Tung-Wei Kuo, Kate Ching-Ju Lin, and Ming-Jer Tsai Academia Sinica, Taiwan National Tsing Hua University, Taiwan Maximizing Submodular Set Function with.
Closing the Smoothness and Uniformity Gap in Area Fill Synthesis Supported by Cadence Design Systems, Inc., NSF, the Packard Foundation, and State of Georgia’s.
Incremental Reduced Support Vector Machines Yuh-Jye Lee, Hung-Yi Lo and Su-Yun Huang National Taiwan University of Science and Technology and Institute.
Non-parametric Methods for Clustering Continuous and Categorical Data Steven X. Wang Dept. of Math. and Stat. York University May 13, 2010.
I owa S tate U niversity Laboratory for Advanced Networks (LAN) Coverage and Connectivity Control of Wireless Sensor Networks under Mobility Qiang QiuAhmed.
Constrained ‘Modern’ Floorplanning
Heuristic & Approximation
Billboard Clouds Xavier Décoret† Frédo Durand† Francois Sillion
Data Driven Resource Allocation for Distributed Learning
Lap Chi Lau we will only use slides 4 to 19
Alexander Shekhovtsov and Václav Hlaváč
Abolfazl Asudeh Azade Nazi Nan Zhang Gautam DaS
Topics in Algorithms Lap Chi Lau.
Andrew B. Kahng and Xu Xu UCSD CSE and ECE Depts.
Han Zhao Advisor: Prof. Lei He TA: Fang Gong
Data Integration with Dependent Sources
SOS is not obviously automatizable,
Effective Social Network Quarantine with Minimal Isolation Costs
Brute Force Approaches
Buffered tree construction for timing optimization, slew rate, and reliability control Abstract: With the rapid scaling of IC technology, buffer insertion.
بسمه تعالی کارگاه ارزشیابی پیشرفت تحصیلی
Max Z = x1 + x2 2 x1 + 3 x2  6 (1) x2  1.5 (2) x1 - x2  2 (3)
Minimizing the Aggregate Movements for Interval Coverage
When do we make decisions?
Parallel Sorting Algorithms
Presentation transcript:

Closing the Smoothness and Uniformity Gap in Area Fill Synthesis Supported by Cadence Design Systems, Inc., NSF, the Packard Foundation, and State of Georgia’s Yamacraw Initiative Closing the Smoothness and Uniformity Gap in Area Fill Synthesis Y. Chen, A. B. Kahng, G. Robins, A. Zelikovsky (UCLA, UCSD, UVA and GSU) http://vlsicad.ucsd.edu Thank you .… Today, I will present our work on “Closing the Smoothness and Uniformity Gap in Area Fill Synthesis". (20 sec)

fixed dissection window The Smoothness Gap Large gap between fixed-dissection and floating window density analysis Gap! fixed dissection window with maximum density floating window with maximum density The motivation of our work is a “smoothness gap” in the fill literature. The very first paper on fill has pointed out that there is potentially large difference between fixed-dissection and floating window density analysis. For example, this is the fixed-dissection window with the maximum density on the given layout. However, by shifting the window up-right, we can find a floating window with a larger density. Clearly, these two features contribute to the smoothness gap. The consequence of the gap is that the fill result will not satisfy the given bounds. However, despite this gap observation in 1998, all existing filling methods fail to consider the potential smoothness gap (50 sec) Fill result will not satisfy the given bounds Despite this gap observation in1998, all existing filling methods fail to consider the potential smoothness gap

Accurate Layout Density Analysis Optimal extremal-density analysis with complexity intractable Multi-level density analysis algorithm shrunk on-grid windows are contained by arbitrary windows any arbitrary window is contained by a bloated on-grid window gap between bloated window and on-grid window accuracy fixed dissection window Prof. Kahng has proposed optimal extremal-density analysis algorithms. However, the algorithm with complexity K square becomes intractable for layout with a large number of fill features. Another method overcoming the intractability is the multi-level density analysis algorithm. It is based on the following facts: Shrunk on-grid windows are contained by arbitrary windows And any arbitrary window is contained by bloated on-grid windows We use the gap between the bloated window and on-grid window as the accuracy of the algorithm (45 sec) arbitrary window W shrunk fixed dissection window bloated fixed dissection window tile

Local Density Variation Type I: max density variation of every r neighboring windows in each row of the fixed-dissection Type II: max density variation of every cluster of windows which cover one tile Type III: max density variation of every cluster of windows which cover tiles We also suggest new methods to measure local uniformity of the layout based on the Lipschitz conditions. We proposed three kind of Local density variations. (click) Type One: the maximum density variation of every r neighboring windows in each row of the fixed-dissection (click) Type Two: the maximum density variation of every cluster of windows which cover one tile (click) Type Three: the maximum density variation of every cluster of windows which cover r/2 x r/2 tiles. (45 sec)

Computational Experience Testcase  LP Greedy MC IGreedy IMC Testcase OrgDen FD Multi-Level T/W/r MaxD MinD DenV Denv L1/16/4 .2572 .0516 .0639 .2653 .0855 .0621 .2706 .0783 .2679 .0756 .084 .0727 L1/16/16 .2643 .0417 .0896 .0915 .0705 .2696 .0773 .2676 .0758 .0755 .0753 The window density variation and violation of the maximum window density in fixed-dissection filling are underestimated case Min-Var LP LipI LP LipII LP Comb LP T/W/r Den V Lip1 Lip2 Lip3 L1/16/4 .0855 .0832 .0837 .0713 .1725 .0553 .167 .1268 .1265 .0649 .0663 .0434 .1143 .0574 .0619 .0409 L1/16/8 .0814 .0734 .0777 .067 .1972 .0938 .1932 .1428 .1702 .1016 .1027 .0756 .1707 .0937 .1005 .0766 L2/28/4 .1012 .0414 .0989 .0841 .0724 .0251 .072 .0693 .0888 .0467 .0871 .0836 .0825 .0242 .0809 .0758 L2/28/8 .0666 .034 .0658 .0654 .0264 .0744 .07 .0331 .0697 .0661 .0747 .0255 .0708 .0656 For the smoothness gap, our experiments show that the window density variation and violation of the maximum window density in fixed-dissection filling are underestimated For the local density variations, our experiments show that the solution with the Min-Var objective value do not always have the best Value in terms of the local smoothness, and the LP with combined objective achieves the best comprehensive solutions. (60 sec) The solutions with the best Min-Var objective value do not always have the best value in terms of local smoothness LP with combined objective achieves the best comprehensive solutions

Thank you! Thank you for your attention.