Mask-writing Strategies for Increased CD Accuracy and Throughput Calibrating Achievable Design Annual Review September 2003 Swamy V. Muddu, Andrew B. Kahng.

Slides:



Advertisements
Similar presentations
Tunable Sensors for Process-Aware Voltage Scaling
Advertisements

Lecture Notes Part 4 ET 483b Sequential Control and Data Acquisition
Leakage and Dynamic Glitch Power Minimization Using MIP for V th Assignment and Path Balancing Yuanlin Lu and Vishwani D. Agrawal Auburn University ECE.
Assessment. Schedule graph may be of help for selecting the best solution Best solution corresponds to a plateau before a high jump Solutions with very.
Ahmed Awad Atsushi Takahash Satoshi Tanakay Chikaaki Kodamay ICCAD’14
S. Babin. , A. B. Kahng, I. I. Mandoiu, S. Muddu CSE & ECE Depts
Dual Graph-Based Hot Spot Detection Andrew B. Kahng 1 Chul-Hong Park 2 Xu Xu 1 (1) Blaze DFM, Inc. (2) ECE, University of California at San Diego.
ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow 1 Automatic Die Placement and Flexible I/O Assignment in 2.5D IC Design Daniel P. Seemuth Prof. Azadeh Davoodi.
A New Force-Directed Graph Drawing Method Based on Edge- Edge Repulsion Chun-Cheng Lin and Hsu-Chen Yen Department of Electrical Engineering, National.
Mutual Information Mathematical Biology Seminar
Background: Scan-Based Delay Fault Testing Sequentially apply initialization, launch test vector pairs that differ by 1-bit shift A vector pair induces.
1 Subfield Scheduling for Througput Maximization in Electron-beam Photomask Fabrication S. Babin *, A.B. Kahng, I.I. Mandoiu, S. Muddu CSE & ECE Depts.,
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
CS244-Introduction to Embedded Systems and Ubiquitous Computing Instructor: Eli Bozorgzadeh Computer Science Department UC Irvine Winter 2010.
Energy-Efficient Target Coverage in Wireless Sensor Networks Mihaela Cardei, My T. Thai, YingshuLi, WeiliWu Annual Joint Conference of the IEEE Computer.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
1 Energy-Efficient localization for networks of underwater drifters Diba Mirza Curt Schurgers Department of Electrical and Computer Engineering.
Improving the Efficiency of Memory Partitioning by Address Clustering Alberto MaciiEnrico MaciiMassimo Poncino Proceedings of the Design,Automation and.
Tracking Moving Objects in Anonymized Trajectories Nikolay Vyahhi 1, Spiridon Bakiras 2, Panos Kalnis 3, and Gabriel Ghinita 3 1 St. Petersburg State University.
1 Simulated Annealing Terrance O ’ Regan. 2 Outline Motivation The algorithm Its applications Examples Conclusion.
Similar Sequence Similar Function Charles Yan Spring 2006.
EDA (CS286.5b) Day 7 Placement (Simulated Annealing) Assignment #1 due Friday.
Maximum Network lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Department.
Delay Efficient Sleep Scheduling in Wireless Sensor Networks Gang Lu, Narayanan Sadagopan, Bhaskar Krishnamachari, Anish Goel Presented by Boangoat(Bea)
Performance Optimization of the Magneto-hydrodynamic Generator at the Scramjet Inlet Nilesh V. Kulkarni Advisors: Prof. Minh Q. Phan Dartmouth College.
Simulated Annealing G.Anuradha. What is it? Simulated Annealing is a stochastic optimization method that derives its name from the annealing process used.
Optimal Stopping of the Context Collection Process in Mobile Sensor Networks Christos Anagnostopoulos 1, Stathes Hadjiefthymiades 2, Evangelos Zervas 3.
Parallel implementation of RAndom SAmple Consensus (RANSAC) Adarsh Kowdle.
Steady and Fair Rate Allocation for Rechargeable Sensors in Perpetual Sensor Networks Zizhan Zheng Authors: Kai-Wei Fan, Zizhan Zheng and Prasun Sinha.
Vilalta&Eick: Informed Search Informed Search and Exploration Search Strategies Heuristic Functions Local Search Algorithms Vilalta&Eick: Informed Search.
Graph Partitioning Donald Nguyen October 24, 2011.
Simulated Annealing.
Number of Blocks per Pole Diego Arbelaez. Option – Number of Blocks per Pole Required magnetic field tolerance of ~10 -4 For a single gap this can be.
Adaptive CSMA under the SINR Model: Fast convergence using the Bethe Approximation Krishna Jagannathan IIT Madras (Joint work with) Peruru Subrahmanya.
EuCARD WP 7 – High Field Magnets Task 7.2 – Support Study Status report EuCARD WP 7 – High Field Magnets Task 2 – Support studies Task 7.2 – Support Study.
Message-Passing for Wireless Scheduling: an Experimental Study Paolo Giaccone (Politecnico di Torino) Devavrat Shah (MIT) ICCCN 2010 – Zurich August 2.
1 A Feature Selection and Evaluation Scheme for Computer Virus Detection Olivier Henchiri and Nathalie Japkowicz School of Information Technology and Engineering.
Generative Topographic Mapping by Deterministic Annealing Jong Youl Choi, Judy Qiu, Marlon Pierce, and Geoffrey Fox School of Informatics and Computing.
Particle Filters for Shape Correspondence Presenter: Jingting Zeng.
Optimal Feedback Control of the Magneto-hydrodynamic Generator for a Hypersonic Vehicle Nilesh V. Kulkarni Advisors: Prof. Minh Q. Phan Dartmouth College.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
The Influence of the Selected Factors on Transient Thermal Impedance of Semiconductor Devices Krzysztof Górecki, Janusz Zarębski Gdynia Maritime University.
A fast algorithm for the generalized k- keyword proximity problem given keyword offsets Sung-Ryul Kim, Inbok Lee, Kunsoo Park Information Processing Letters,
XIAOYU HU AANCHAL GUPTA Multi Threshold Technique for High Speed and Low Power Consumption CMOS Circuits.
Informed search algorithms Chapter 4. Best-first search Idea: use an evaluation function f(n) for each node –estimate of "desirability"  Expand most.
CS244-Introduction to Embedded Systems and Ubiquitous Computing Instructor: Eli Bozorgzadeh Computer Science Department UC Irvine Winter 2010.
SiO2 ETCH PROPERTIES AND ION ENERGY DISTRIBUTION IN PULSED CAPACITIVELY COUPLED PLASMAS SUSTAINED IN Ar/CF4/O2* Sang-Heon Songa) and Mark J. Kushnerb)
Mechanical and fluidic integration of scintillating microfluidic channels into detector system 1 Davy Brouzet 10 th September 2014.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Efficient k-Coverage Algorithms for Wireless Sensor Networks Mohamed Hefeeda.
Silesian University of Technology in Gliwice Inverse approach for identification of the shrinkage gap thermal resistance in continuous casting of metals.
Thermal Aware Data Management in Cloud based Data Centers Ling Liu College of Computing Georgia Institute of Technology NSF SEEDM workshop, May 2-3, 2011.
Simulated Annealing G.Anuradha.
Written by Changhyun, SON Chapter 5. Introduction to Design Optimization - 1 PART II Design Optimization.
MSc in High Performance Computing Computational Chemistry Module Parallel Molecular Dynamics (i) Bill Smith CCLRC Daresbury Laboratory
Data Retention in MLC NAND FLASH Memory: Characterization, Optimization, and Recovery. 서동화
-1- UC San Diego / VLSI CAD Laboratory Optimization of Overdrive Signoff Tuck-Boon Chan, Andrew B. Kahng, Jiajia Li and Siddhartha Nath Tuck-Boon Chan,
-1- Delay Uncertainty and Signal Criticality Driven Routing Channel Optimization for Advanced DRAM Products Samyoung Bang #, Kwangsoo Han ‡, Andrew B.
Abstract 1/2 Wireless Sensor Networks (WSNs) having limited power resource report sensed data to the Base Station (BS) that requires high energy usage.
NanoCAD Lab UCLA Effective Model-Based Mask Fracturing Heuristic Abde Ali Kagalwalla and Puneet Gupta NanoCAD Lab Department of Electrical Engineering,
Towards Adaptive Optimal Control of the Scramjet Inlet Nilesh V. Kulkarni Advisors: Prof. Minh Q. Phan Dartmouth College Prof. Robert F. Stengel Princeton.
Metaheuristics for the New Millennium Bruce L. Golden RH Smith School of Business University of Maryland by Presented at the University of Iowa, March.
1 Power Efficient Monitoring Management in Sensor Networks A.Zelikovsky Georgia State joint work with P. BermanPennstate G. Calinescu Illinois IT C. Shah.
An unsupervised conditional random fields approach for clustering gene expression time series Chang-Tsun Li, Yinyin Yuan and Roland Wilson Bioinformatics,
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Željko V. Despotović, Miloš.D. Jovanović Mihajlo Pupin Institute, University of Belgrade, Serbia
Unified Adaptivity Optimization of Clock and Logic Signals Shiyan Hu and Jiang Hu Dept of Electrical and Computer Engineering Texas A&M University.
Lesson 10: Sensor and Transducer Electrical Characteristics
More on Search: A* and Optimization
Boltzmann Machine (BM) (§6.4)
Presentation transcript:

Mask-writing Strategies for Increased CD Accuracy and Throughput Calibrating Achievable Design Annual Review September 2003 Swamy V. Muddu, Andrew B. Kahng (Joint work with Sergey Babin and Ion Mandoiu) Abstract Resist heating and proximity effects in e-beam mask writing affect critical dimension (CD) accuracy and throughput. Tight CD control is important for minimizing on-chip variability in future technology nodes. High mask-writing throughput is needed for reducing soaring mask costs. Resist heating is a significant contributor to CD distortion on mask. Current e-beam writing strategies optimize beam current density, number of passes etc., but at the cost of decreasing throughput. We propose a new e-beam writing strategy that reduces CD distortion while maintaining throughput. Simulation results indicate non-sequential writing of subfields lead to effective dissipation of heat and improve CD distortion. References S. Babin, A.B. Kahng, I.I. Mandoiu, S. Muddu, “ Resist heating dependence on subfield scheduling in 50kV electron beam maskmaking”, Proc. of Photomask Japan, April 2004, to appear Sergey Babin, “Measurement of resist heating in photomask fabrication”, J. Vac. Sci. Technol. B 15(6), Nov/Dec 1997, pp Motivation Mask writing in DSM regimes is limited by resist heating effects, such as CD distortion Current techniques for reducing resist heating (reducing e-beam density, multi-pass writing, etc.) reduce mask writing throughput To reduce resist heating, avoid successive writing of subfields To maintain throughput we increase beam current density such that reduction in dwell time compensates for increase in travel time Mask Writing Schedule Problem Given: Beam voltage, resist parameters, threshold temperature T max Find: Beam current density and subfield writing schedule such that the maximum resist temperature never exceeds T max Variable-shaped E-beam Writing Taxonomy of mask features Fractures: smallest features written on the mask; dimensions in the range 0.5µm-2µm Minor field: collection of fractures Subfield: collection of minor fields; typical subfield size: 64µm X 64µm Major field or cell: collection of subfields E-beam writing technology context High power densities (up to 1GW/c.c.) needed to meet SIA Roadmap requirements Power densities induce local heating causing significant critical dimension (CD) distortion Scheduling of fractures incurs large positioning overheads Scheduling subfields incurs very low overheads, yet is still effective in reducing excessive heating Subfield Scheduling Key observation: scheduling of subfields decreases maximum resist temperature Non-sequential writing  throughput overhead due to beam settling time To maintain throughput, equalize mask write times by increasing beam current density Rise in temperature due to increased current density is offset by non-sequential writing schedule Greedy Subfield Scheduling Greedy algorithm starts from a random ordering of subfields and iteratively modifies the ordering by swapping pairs of subfields Evaluating the cost function takes O(n 2 ) time, and thus the greedy algorithm requires O(n 4 ) time per improving swap, where n is the number of subfields in a main deflection field Our implementation evaluates only pairs (i,j) in which i is a subfield with max temperature; this reduces runtime to O(n 3 ) per improving swap Greedy scheduling 1. Start with random subfield order  2. Repeat forever –For all pairs (i,j) of subfields, compute cost of  with i and j swapped –If there exists at least one cost-improving swap, then modify  by applying a swap with highest cost gain –Else exit repeat Cost Computation The cost of a subfield order  is  T max + (1-  )T avg ; T max  max temperature before writing T avg  avg temperature before writing T max corresponds to CD distortion due to resist heating, while T avg corresponds to increase in mask write time To find an ordering, we can associate different weightings to T max, T avg. In our experiments we use  = 0.5 The temperature rise of a subfield s due to the writing of subfield f depends on the distance between s and f, the energy deposited while writing f, and the thermal properties of resist: The temperature of each subfield decays exponentially between flashes With this model, evaluating the cost function for a given subfield order requires O(n 2 ) time Simulation Setup Resist heating simulations performed using TEMPTATION resist heating simulator Simulated subfield scheduling strategies: (1) Sequential and (2) Greedy A two-phase simulation setup was used to simulate 16 x 16 subfields Phase I: Every subfield is flashed using 4 coarse flashes with total dose equal to that of detailed fracture flashes Phase II: The simulation is repeated with the “critical” subfield (i.e., the subfield with maximum temperature before writing in phase I) flashed using detailed fracture flashes (512 2µm x 2µm fractures) Phase-1: coarse subfield ordering simulation Phase-2: detailed critical subfield simulation Chess board pattern within critical subfield Scheduling Results Critical subfield temperature profiles before occurrence of flash for 16×16 subfield pattern Max  C Mean  C (a) Sequential schedule Max 32.68C Mean 16.07C (b) Greedy schedule Detailed temperature profile Sequential: Max=  C Detailed temperature profile Greedy: Max=93.70  C Conclusions “Self-avoiding” subfield ordering reduces the maximum temperature of resist by spacing successive writings To normalize the throughput due to scheduling, we decrease the dwell time of each subfield by increasing the current density Increase in current density does not increase resist heating significantly because of subfield ordering Future Work Use accurate temperature modeling approach in cost computation in greedy scheduling Quantify the improvements in CD and throughput due to decrease in resist temperature