Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 95
PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, GRID AND CLOUD COMPUTING FOR ENGINEERING Edited by:
Paper 21
Parallel Computing and Challenges for Thin Film Optics Technology A.V. Tikhonravov and M.K. Trubetskov
Research Computing Center, Moscow State University, Russia A.V. Tikhonravov, M.K. Trubetskov, "Parallel Computing and Challenges for Thin Film Optics Technology", in , (Editors), "Proceedings of the Second International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 21, 2011. doi:10.4203/ccp.95.21
Keywords: parallelization, graphical accelerators, thin films, optical coatings, design, production simulation.
Summary
The most practical design must provide the highest production yield in a process of optical coating manufacturing. Instead of using costly production runs, computer simulations of real production processes are now considered as the most promising approach to choosing optimal designs for challenging applications [4]. The theory of probability predicts that reliable production yield estimations may require thousands of computational manufacturing experiments. Computational time of a single computational manufacturing experiment is dependent on a type of monitoring approach used for controlling thicknesses of coating layers. Experiments simulating production runs with optical monitoring are the most time consuming experiments. Depending on the number of layers of examined theoretical design, a single experiment with broadband optical monitoring may require up to several minutes on a personal computer. Thus performing thousands of computational experiments with multiple theoretical designs is possible only with the parallelization of computational manufacturing experiments. Parallelization of algorithms used for these experiments was performed both for SMP configurations on the basis of OpenMP and for GPU architecture on the basis of CUDA technology. For the latest Fermi-based GPUs the algorithm implementation is three to four times faster than the SMP configurations with 2 dual-core 3 GHz Intel Xeon processors. References
purchase the full-text of this paper (price £20)
go to the previous paper |
|