Acceleration of split-field finite difference time-domain method for anisotropic media by means of graphics processing unit computing

The implementation of split-field finite difference time domain (SF-FDTD) applied to light-wave propagation through periodic media with arbitrary anisotropy method in graphics processing units (GPUs) is described. The SF-FDTD technique and the periodic boundary condition allow the consideration of a single period of the structure reducing the simulation grid. Nevertheless, the analysis of the anisotropic media implies considering all the electromagnetic field components and the use of complex notation. These aspects reduce the computational efficiency of the numerical method compared with the isotropic and nonperiodic implementation. Specifically, the implementation of the SF-FDTD in the Kepler family of GPUs of NVIDIA is presented. An analysis of the performance of this implementation is done, and several applications have been considered in order to estimate the possibilities provided by both the formalism and the implementation into GPU: binary phase gratings and twisted-nematic liquid crystal cells. Regarding the analysis of binary phase gratings, the validity of the scalar diffraction theory is evaluated by the comparison of the diffraction efficiencies predicted by SF-FDTD. The analysis for the second order of diffraction is extended, which is considered as a reference for the transmittance obtained by the SF-FDTD scheme for periodic media.This work was supported by the Ministerio de Economía y Competitividad of Spain under projects FIS2011-29803-C02-01 and FIS2011-29803-C02-02 and by the Generalitat Valenciana of Spain under projects PROMETEO/2011/021, ISIC/2012/013, and GV/2012/099

Bio-Inspired Optimization of Ultra-Wideband Patch Antennas Using Graphics Processing Unit Acceleration

Ultra-wideband (UWB) wireless systems have recently gained considerable attention as effective communications platforms with the properties of low power and high data rates. Applications of UWB such as wireless USB put size constraints on the antenna, however, which can be very dicult to meet using typical narrow band antenna designs. The aim of this thesis is to show how bio-inspired evolutionary optimization algorithms, in particular genetic algorithm (GA), particle swarm optimization (PSO) and biogeography-based optimization (BBO) can produce novel UWB planar patch antenna designs that meet a size constraint of a 10 mm 10 mm patch. Each potential antenna design is evaluated with the nite dierence time domain (FDTD) technique, which is accurate but time-consuming. Another aspect of this thesis is the modication of FDTD to run on a graphics processing unit (GPU) to obtain nearly a 20 speedup. With the combination of GA, PSO, BBO and GPU-accelerated FDTD, three novel antenna designs are produced that meet the size and bandwidth requirements applicable to UWB wireless USB system

Parallel Implementation of the Discrete Green's Function Formulation of the FDTD Method on a Multicore Central Processing Unit

Parallel implementation of the discrete Green's function formulation of the finite-difference time-domain (DGF-FDTD) method was developed on a multicore central processing unit. DGF-FDTD avoids computations of the electromagnetic field in free-space cells and does not require domain termination by absorbing boundary conditions. Computed DGF-FDTD solutions are compatible with the FDTD grid enabling the perfect hybridization of FDTD with the use of time-domain integral equation methods. The developed implementation can be applied to simulations of antenna characteristics. For the sake of example, arrays of Yagi-Uda antennas were simulated with the use of parallel DGF-FDTD. The efficiency of parallel computations was investigated as a function of the number of current elements in the FDTD grid. Although the developed method does not apply the fast Fourier transform for convolution computations, advantages stemming from the application of DGF-FDTD instead of FDTD can be demonstrated for one-dimensional wire antennas when simulation results are post-processed by the near-to-far-field transformation

Sophie, an FDTD code on the way to multicore, getting rid of the memory bandwidth bottleneck better using cache.

21 pagesFDTD codes, such as Sophie developed at CEA/DAM, no longer take advantage of the processor's increased computing power, especially recently with the raising multicore technology. This is rooted in the fact that low order numerical schemes need an important memory bandwidth to bring and store the computed fields. The aim of this article is to present a programming method at the software's architecture level that improves the memory access pattern in order to reuse data in cache instead of constantly accessing RAM memory. We will exhibit a more than two computing time improvement in practical applications. The target audience of this article is made of computing scientists and of electrical engineers that develop simulation codes with no specific knowledge in computer science or electronics

The Investigation of Efficiency of Physical Phenomena Modelling Using Differential Equations on Distributed Systems

This work is dedicated to development of mathematical modelling software. In this dissertation numerical methods and algorithms are investigated in software making context. While applying a numerical method it is important to take into account the limited computer resources, the architecture of these resources and how do methods affect software robustness. Three main aspects of this investigation are that software implementation must be efficient, robust and be able to utilize specific hardware resources. The hardware specificity in this work is related to distributed computations of different types: single CPU with multiple cores, multiple CPUs with multiple cores and highly parallel multithreaded GPU device. The investigation is done in three directions: GPU usage for 3D FDTD calculations, FVM method usage to implement efficient calculations of a very specific heat transferring problem, and development of special techniques for software for specific bacteria self organization problem when the results are sensitive to numerical methods, initial data and even computer round-off errors. All these directions are dedicated to create correct technological components that make a software implementation robust and efficient. The time prediction model for 3D FDTD calculations is proposed, which lets to evaluate the efficiency of different GPUs. A reasonable speedup with GPU comparing to CPU is obtained. For FVM implementation the OpenFOAM open source software is selected as a basis for implementation of calculations and a few algorithms and their modifications to solve efficiency issues are proposed. The FVM parallel solver is implemented and analyzed, it is adapted to heterogeneous cluster Vilkas. To create robust software for simulation of bacteria self organization mathematically robust methods are applied and results are analyzed, the algorithm is modified for parallel computations

Simulation for Reliability, Hardware Security, and Ising Computing in VLSI Chip Design

The continued scaling of VLSI circuits has provided a wealth of opportunities andchallenges to the VLSI circuit design area. Both these challenges and opportunities, however,require new simulation tools that can enable their solution or exploitation as classicalmethods typically dealt with problem domains with smaller scales or less complexity. Inthis dissertation, simulation methods are presented to address the emerging VLSI designtopics of Electromigration induced aging and Ising computing and are then applied to theapplication areas of hardware security and graph partitioning respectively.The Electromigration aging effect in VLSI circuits is a long-term reliability issueaffecting current carrying metal wires leading to IR drop degradation. Typically, simpleanalytical equations can determine a wire’s effective age or if it will be affected by the EMaging effect at all. However, these classical methods are overly conservative and can lead toover design or unnecessary design iterations. Furthermore, it is expected that the EM agingeffect will become more severe in future Integrated Cirucits (ICs) due to increasing currentdensities and the prevalance of polycrystaline copper atom structures seen at small wiredimensions. For this reason, more comprehensive simulation techniques that can efficientlysimulate the EM effect with less conservative results can help mitigate overdesign andincrease design margins while reducing design iterations.The area of Hardware Security is becoming increasingly important as the chipsupply chain becomes more globalized and the integrity of chips becomes more diffiuclt toverify. Utilizing the accurate simulation techniques for EM, we can utilize this reliabilityeffect to demonstrate how a reliability based attack could be perpatrated. Furthermore, wecan utilize this aging effect as a defense mechanism to help us validate the integrity of anIC and detect counterfeit chips in the component supply chain market.Ising computing is an emerging method of solving combinatorial optimization problemsby simulating the interactions of so-called spin glasses and their interactions. Borrowingconcepts from quantum computing, this methods mimics the quantum interaction betweenspin glasses in such a way that finding a ground state of these spin glass models leadsto the solution of a particular problem. In this dissertation, effective methods of simulatingthe spin glass interactions using General Purpose Graphics Processing Units (GPGPUs)and finding their ground state are developed.In addition to the GPU based Ising model simulations, important combinatorialproblems can be mapped to the Ising model. In this dissertation the Ising solver is appliedto graph partitioning which can be utilized in VLSI design and many other domains as well.Specifically, solvers for the maxcut problem and the balanced min-cut partitioning problemare developed

Analysis of metal oxide varistor arresters for protection of multiconductor transmission lines using unconditionally-stable Crank-Nicolson FDTD

Surge arresters may represent an efficient choice for limiting lightning surge effects, significantly reducing the outage rate of power lines. The present work firstly presents an efficient numerical approach suitable for insulation coordination studies based on an implicit Crank-Nicolson finite difference time domain method; then, the IEEE recommended surge arrester model is reviewed and implemented by means of a local implicit scheme, based on a set of non-linear equations, that are recast in a suitable form for efficient solution. The model is proven to ensure robustness and second-order accuracy. The implementation of the arrester model in the implicit Crank-Nicolson scheme represents the added value brought by the present study. Indeed, its preserved stability for larger time steps allows reducing running time by more than 60% compared to the well-known finite difference time domain method based on the explicit leap-frog scheme. The reduced computation time allows faster repeated solutions, which need to be looked for on assessing the lightning performance (randomly changing, parameters such as peak current, rise time, tail time, location of the vertical leader channel, phase conductor voltages, footing resistance, insulator strength, etc. would need to be changed thousands of times)