Resumen:
|
The use of atomistic methods, such as the Continuous Cellular Automaton (CCA), is currently regarded as a computationally efficient and experimentally accurate approach for the simulation of anisotropic etching of various ...[+]
The use of atomistic methods, such as the Continuous Cellular Automaton (CCA), is currently regarded as a computationally efficient and experimentally accurate approach for the simulation of anisotropic etching of various substrates in the manufacture of Micro-electro-mechanical Systems (MEMS). However, when the features of the chemical process are modified, a time-consuming calibration process needs to be used to transform the new macroscopic etch rates into a corresponding set of atomistic rates. Furthermore, changing the substrate requires a labor-intensive effort to reclassify most atomistic neighborhoods. In this context, the Level Set (LS) method provides an alternative approach where the macroscopic forces affecting the front evolution are directly applied at the discrete level, thus avoiding the need for reclassification and/or calibration. Correspondingly, we present a fully-operational Sparse Field Method (SFM) implementation of the LS approach, discussing in detail the algorithm and providing a thorough characterization of the computational cost and simulation accuracy, including a comparison to the performance by the most recent CCA model. We conclude that the SFM implementation achieves similar accuracy as the CCA method with less fluctuations in the etch front and requiring roughly 4 times less memory. Although SFM can be up to 2 times slower than CCA for the simulation of anisotropic etchants, it can also be up to 10 times faster than CCA for isotropic etchants. In addition, we present a parallel, GPU-based implementation (gSFM) and compare it to an optimized, multicore CPU version (cSFM), demonstrating that the SFM algorithm can be successfully parallelized and the simulation times consequently reduced, while keeping the accuracy of the simulations. Although modern multicore CPUs provide an acceptable option, the massively parallel architecture of modern GPUs is more suitable, as reflected by computational times for gSFM up to 7.4 times faster than for cSFM. (c) 2013 Elsevier B.V. All rights reserved.
[-]
|
Agradecimientos:
|
We thank the anonymous reviewers for their valuable comments and suggestions. This work has been supported by the Spanish FPI-MICINN BES-2011-045940 grant and the Ramon y Cajal Fellowship Program by the Spanish Ministry ...[+]
We thank the anonymous reviewers for their valuable comments and suggestions. This work has been supported by the Spanish FPI-MICINN BES-2011-045940 grant and the Ramon y Cajal Fellowship Program by the Spanish Ministry of Science and Innovation. Also, we acknowledge support by the JAE-Doc grant from the Junta para la Ampliacion de Estudios program co-funded by FSE and the Professor Partnership Program by NVIDIA Corporation.
[-]
|