Abstract A new Open Artwork System Interchange Standard (OASIS) has been recently proposed for replacing the GDSII format. A primary objective of the new.

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

Design of the fast-pick area Based on Bartholdi & Hackman, Chpt. 7.
Geographic Information Systems GIS Data Models. 1. Components of Geographic Data Spatial locations Attributes Topology Time.
Geographic Information Systems
Fill Reduction Algorithm Using Diagonal Markowitz Scheme with Local Symmetrization Patrick Amestoy ENSEEIHT-IRIT, France Xiaoye S. Li Esmond Ng Lawrence.
DPIMM-II 2003 UCSD VLSI CAD LAB Compression Schemes for "Dummy Fill" VLSI Layout Data Robert Ellis, Andrew B. Kahng and Yuhong Zheng ( Texas A&M University.
Transportation Problem (TP) and Assignment Problem (AP)
Approximations of points and polygonal chains
Image Data Representations and Standards
1 EE5900 Advanced Embedded System For Smart Infrastructure Static Scheduling.
ORTHOGONAL ARRAYS APPLICATION TO PSEUDORANDOM NUMBERS GENERATION AND OPTIMIZATION PROBLEMS A.G.Chefranov †‡, T.A.Mazurova ‡, I.D.Sidorov ‡, T.S.Letia 
Label Placement and graph drawing Imo Lieberwerth.
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
Tutorial 6 of CSCI2110 Bipartite Matching Tutor: Zhou Hong ( 周宏 )
5-1 Chapter 5 Tree Searching Strategies. 5-2 Satisfiability problem Tree representation of 8 assignments. If there are n variables x 1, x 2, …,x n, then.
Complex Feature Recognition: A Bayesian Approach for Learning to Recognize Objects by Paul A. Viola Presented By: Emrah Ceyhan Divin Proothi Sherwin Shaidee.
Optimization of Pearl’s Method of Conditioning and Greedy-Like Approximation Algorithm for the Vertex Feedback Set Problem Authors: Ann Becker and Dan.
Maximal Lifetime Scheduling in Sensor Surveillance Networks Hai Liu 1, Pengjun Wan 2, Chih-Wei Yi 2, Siaohua Jia 1, Sam Makki 3 and Niki Pissionou 4 Dept.
1.2 Row Reduction and Echelon Forms
Linear Equations in Linear Algebra
Greedy vs Dynamic Programming Approach
June 3, 2015Windows Scheduling Problems for Broadcast System 1 Amotz Bar-Noy, and Richard E. Ladner Presented by Qiaosheng Shi.
The Hungarian algorithm for non-square arrays
1 Amortized Analysis Consider an algorithm in which an operation is executed repeatedly with the property that its running time fluctuates throughout the.
Monte-Carlo Methods for Chemical-Mechanical Planarization on Multiple-Layer and Dual-Material Models Supported by Cadence Design Systems, Inc., NSF, the.
Implicit Hitting Set Problems Richard M. Karp Harvard University August 29, 2011.
Practical Iterated Fill Synthesis for CMP Uniformity Supported by Cadence Design Systems, Inc. Y. Chen, A. B. Kahng, G. Robins, A. Zelikovsky (UCLA, UVA.
DPIMM-03 1 Performance-Impact Limited Area Fill Synthesis Yu Chen, Puneet Gupta, Andrew B. Kahng (UCLA, UCSD) Supported by Cadence.
NEW APPROACH TO CALCULATION OF RANGE OF POLYNOMIALS USING BERNSTEIN FORMS.
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.
Approximation Algorithms Motivation and Definitions TSP Vertex Cover Scheduling.
Hierarchical Dummy Fill for Process Uniformity Supported by Cadence Design Systems, Inc. Y. Chen, A. B. Kahng, G. Robins, A. Zelikovsky (UCLA, UCSD, UVA.
Hierarchical Dummy Fill for Process Uniformity Supported by Cadence Design Systems, Inc. NSF, and the Packard Foundation Y. Chen, A. B. Kahng, G. Robins,
Improved results for a memory allocation problem Rob van Stee University of Karlsruhe Germany Leah Epstein University of Haifa Israel WADS 2007 WAOA 2007.
CSE Lectures 22 – Huffman codes
Accurate Process-Hotspot Detection Using Critical Design Rule Extraction Y. Yu, Y. Chan, S. Sinha, I. H. Jiang and C. Chiang Dept. of EE, NCTU, Hsinchu,
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
: Chapter 12: Image Compression 1 Montri Karnjanadecha ac.th/~montri Image Processing.
Planning Production of a Set of Semiconductor Components with Uncertain Wafer and Component Yield Frank W. Ciarallo Assistant Professor Biomedical, Industrial.
Foundations of Computer Science Computing …it is all about Data Representation, Storage, Processing, and Communication of Data 10/4/20151CS 112 – Foundations.
Linear Programming Data Structures and Algorithms A.G. Malamos References: Algorithms, 2006, S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani Introduction.
Motif finding with Gibbs sampling CS 466 Saurabh Sinha.
Geometric Matching on Sequential Data Veli Mäkinen AG Genominformatik Technical Fakultät Bielefeld Universität.
Incorporating Dynamic Time Warping (DTW) in the SeqRec.m File Presented by: Clay McCreary, MSEE.
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.
Major objective of this course is: Design and analysis of modern algorithms Different variants Accuracy Efficiency Comparing efficiencies Motivation thinking.
 Chemical-Mechanical Polishing (CMP)  Rotating pad polishes each layer on wafers to achieve planarized surfaces  Uneven features cause polishing pad.
Boolean Minimizer FC-Min: Coverage Finding Process Petr Fišer, Hana Kubátová Czech Technical University Department of Computer Science and Engineering.
Reducing Test Application Time Through Test Data Mutation Encoding Sherief Reda and Alex Orailoglu Computer Science Engineering Dept. University of California,
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
Tetris Agent Optimization Using Harmony Search Algorithm
Yen-Ting Yu Iris Hui-Ru Jiang Yumin Zhang Charles Chiang DRC-Based Hotspot Detection Considering Edge Tolerance and Incomplete Specification ICCAD’14.
1 EE5900 Advanced Embedded System For Smart Infrastructure Static Scheduling.
N- Queens Solution with Genetic Algorithm By Mohammad A. Ismael.
HANGMAN OPTIMIZATION Kyle Anderson, Sean Barton and Brandyn Deffinbaugh.
Compressing Bi-Level Images by Block Matching on a Tree Architecture Sergio De Agostino Computer Science Department Sapienza University of Rome ITALY.
Fast and Efficient Static Compaction of Test Sequences Based on Greedy Algorithms Jaan Raik, Artur Jutman, Raimund Ubar Tallinn Technical University, Estonia.
1 1.2 Linear Equations in Linear Algebra Row Reduction and Echelon Forms © 2016 Pearson Education, Ltd.
(iii) Simplex method - I D Nagesh Kumar, IISc Water Resources Planning and Management: M3L3 Linear Programming and Applications.
The Hungarian Algorithm – Maximisation problems The Hungarian algorithm for maximisation problems To solve a maximisation problem using the Hungarian algorithm,
Lecture 3: Uninformed Search
The Hungarian algorithm for non-square arrays
B. Jayalakshmi and Alok Singh 2015
Objective of This Course
Linear Equations in Linear Algebra
EE5900 Advanced Embedded System For Smart Infrastructure
The Hungarian algorithm for non-square arrays
Linear Equations in Linear Algebra
Presentation transcript:

Abstract A new Open Artwork System Interchange Standard (OASIS) has been recently proposed for replacing the GDSII format. A primary objective of the new OASIS format is to enhance the compressibility of layout data. We compare the data compression capability of the Full OASIS set of operators with those also present in GDSII, which we refer to as the Restricted OASIS format. We measure the compression quality of the OASIS and GDSII operators in two contexts: (1) Compressible fill generation, where the fill amounts are specified and compressible fill is then generated, and (2) Post-fill data compression, when fill has already been generated and is then compressed. Our experimental results confirm the advantages of the OASIS compression operators: compressed file sizes using the Full OASIS format are on average about twice as small as those obtained using the Restricted OASIS format. We propose new OASIS-based compression algorithms which outperform industry physical verification tools. We also evaluate the respective merits of the individual repetition operators in OASIS and suggest possible improvements to the OASIS repetition operators.

Motivation Dummy Fill is added to VLSI layouts to reduce manufacturing variation, but it explodes layout data volume and creates a bottle neck in the design-to-manufacturing handoff. We require dummy fill compression. Filled layout with dummy fill grouped in 9 repetitions Post-CMP ILD thickness Features Dummy featuresPost-CMP ILD thickness Dummy fill equalizes spatial layout density and improves CMP uniformity

Full OASIS Repetition Types Geometry Compression Operators TYPE 4 TYPE 5 TYPE 6 TYPE 7 TYPE 8 The OASIS Format An OASIS file is a sequence of bytes divided into records. A fill feature (rectangle, polygon, trapezoid, circle, etc.) is represented by the corresponding OASIS record format. OASIS defines eight repetition types. A repetition represents an “array” of records, and thus enables compression of fill data. Restricted OASIS = “GDSII AREF” TYPE 1 TYPE 2 TYPE 3

Compression ratio of a repetition: R c = ( M  N  A)/(A+R) M,N = #rows, columns in a fill feature array; A = #integers needed to represent a single fill feature; R = #integers needed to store additional information when using repetitions Compressibility TypeDescription (M, N, P > 1)RcRc Asymptotic R c 1 M  N matrix with uniform orthogonal spacing 7MN/11MN 2N vector with uniform horizontal spacing7N/9N 3M vector with uniform vertical spacing7M/9M 4N vector with non-uniform horizontal spacing7N/(7+N)7 5M vector with non-uniform vertical spacing7M/(7+M)7 6 M  N repetition with uniform and (potentially) diagonal displacements 7MN/11 ~ 7MN/13 MN 7 P repetition with uniform and (potentially) diagonal displacements 7P/9 ~ 7P/10 P 8 P-element repetition with uniform and (potentially) diagonal displacements 7P/(6+2P)3.5

Generic Strategy Generic Strategy for both Compressible Fill Generation and Fill Compression Find a repetition of Type 1, 2, 3, 6, or 7 (types with maximum compression ratio R c ) If R c > limitCR, output (= accept) the repetition and update fill data Repeat Steps 1 and 2 until no repetition exists with R c > limitCR Find a repetition of Type 4, 5 to satisfy the fill requirements (compressible fill generation case) or to cover the remaining fill geometries (fill compression case) Experimentally, limitCR = 5.0 is chosen for all algorithms. Types 1 and 6 appear to be the most powerful operators, followed by Types 2, 3 and 7. Types 4 and 5 appear least powerful.

Problem: Given a design rule-correct layout L consisting of m  n tiles, and fill site arrays for each tile, create a minimum size compressed fill pattern file F using OASIS repetitions, such that the window density variation in the layout L+F is within the given density bounds (L b,U b ). Strict greedy heuristic: iteratively find an available repetition with largest compression ratio O(n 5 ) time complexity: provides good solutions but is impractical Greedy speedup scheme: trade off between time complexity and compression performance by picking an acceptable, rather than best- possible, repetition  time complexity becomes practical. Use Greedy speedup of compressible fill generation algorithm to compare between availability of Repetition Types 1-7 (Full OASIS) and availability of only Repetition Types 1-3 (GDSII = Restricted OASIS) Compressible Fill Generation

Compressible Fill Generation Results FULL OASIS vs. RESTRICTED OASIS RESULT: Full OASIS compression operators yield file sizes approximately one-half those obtained with Restricted OASIS compression operators. This confirms a definite, but limited, advantage of OASIS over GDSII Stream format.

Problem: Given a fill layout, output a minimum-size compressed representation using OASIS repetition types. Exhaustive-Search Based Greedy (ESBG) For each fill geometry, find all repetitions of Types {1, 2, 3, 6, 7} originating at that site, and output (= accept) the repetition with maximum compression ratio R c >limitCR Update list of remaining uncovered fill geometries Use perfect bipartite matching to find minimum cover of remaining fill layout sites using repetition Types {4, 5} Regularity-Search Based Greedy (RSBG) Use spatial regularity-detection algorithm (KahngRobins91) to find maximal sets of regularly spaced collinear sites (1-D lattices), or maximal regularly spaced 2-D lattices of sites Construct instances of repetition Types by chaining together lattices that have same periodicity Use perfect bipartite matching to find minimum cover of remaining fill layout sites using repetition Types {4, 5} Fill Compression

FULL vs. RESTRICTED, ESBG vs. RSBG : Run both ESBG and RSBG using either Full OASIS or Restricted OASIS compression operators RESULT: Full OASIS reduces data volume by 1.4x (2x) over Restricted OASIS when using ESBG (RSBG) compression RESULT: ESBG (RSBG) is superior on Restricted (Full) OASIS RESULT: Repetition Types 6, 7 helpful only in special “tilted fill” context; Types 4, 5 surprisingly valuable for compression We suggest a new Repetition Type = product of Types 4 and 5 to achieve an asymptotically intermediate level of compression. Fill Compression Results