Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 19 of 19 for “"3D FFT"”.

  1. Using offline routing to implement a low latenc 3D FFT in a multinode FPGA system

    … due to strong scaling, such as a calculating a 3D FFT for Molecular Dynamics simulations, can be problematic for traditional high performance computing (HPC) clusters. A multinode FPGA array is a good solution for these types of problems due to the direct high speed connections and flexible …

    bu Repository record for Using offline routing to implement a low latenc 3D FFT in a multinode FPGA system (opens in a new tab)

  2. Akcelerace ultrazvukových simulací pomocí multi-GPU systémů

    … paměti.Hlavním cílem je akcelerovat výpočet 3D FFT, který je hlavní součástí simulací knihovny k- Wave .K- Wave je C++/ Matlab knihovna určena pro simulaci šíření ultrazvukových vln v 1D , 2D nebo 3D prostoru.Akcelerace těchto funkcí je potřebná, jelikož se jedná o výpočetně náročně simulace.

    brno-tech Repository record for Akcelerace ultrazvukových simulací pomocí multi-GPU systémů (opens in a new tab)

  3. Use of multi-GPU systems for large FFTs: with applications in ultrasound simulations

    … by its use of the Fast Fourier Transform (FFT). The FFT can account for over half of the time spent by ultrasound simulations, with the remaining consisting of embarrassingly parallel arithmetic [28]. The use of a Graphics Processing Unit (GPU) for general computations like the FFT has …

    anu Repository record for Use of multi-GPU systems for large FFTs: with applications in ultrasound simulations (opens in a new tab)

  4. Fast Fourier Transform Based Force Histogram Computation for 3D Raster Data

    … algorithm, and Fast Fourier Transform (FFT) based algorithm that has a high computational cost. The line-based algorithm has previously been extended to the 3D case, but found to be unstable, and affected by a variety of factors. This thesis presents an extension of the FFT-based …

    guelph Repository record for Fast Fourier Transform Based Force Histogram Computation for 3D Raster Data (opens in a new tab)

  5. Automatic data aggregation for software distributed shared memory systems

    … We used a test suite of four applications--3D-FFT, Barnes-Hut, Ilink and Shallow. For these applications we obtained 40% to 66% reduction in message counts which resulted in 6% to 19% improvement in execution times.

    rice Repository record for Automatic data aggregation for software distributed shared memory systems (opens in a new tab)

  6. High performance communication on reconfigurable clusters

    … to a critical strong-scaling HPC kernel, the 3D FFT. The experimental results demonstrate that the performance of our design is faster than that on CPUs and GPUs by at least one order of magnitude (achieving strong scaling for the target applications). Surprisingly, the FPGA cluster …

    bu Repository record for High performance communication on reconfigurable clusters (opens in a new tab)

  7. A node-based approach to charm-FFT

    Parallel 3D Fast Fourier Transform is a communication intensive algorithm that suffers from the unignorable communication overhead. Because the interconnect communication bandwidth is a static component, adjustments to reduce or hide the necessary communication overheads are performed to obtain the …

    uiuc Repository record for A node-based approach to charm-FFT (opens in a new tab)

  8. Optimizing Collective Communication for Scalable Scientific Computing and Deep Learning

    … focus is on optimizing the alltoall operation in 3D Fast Fourier Transform (FFT) applications and the allreduce operation in parallel deep learning, particularly on High-Performance Computing (HPC) systems. Advanced communication algorithms and methods are explored and implemented to improve …

    utk-theses Repository record for Optimizing Collective Communication for Scalable Scientific Computing and Deep Learning (opens in a new tab)

  9. Software Support for Efficient Data Movement and Memory Sharing in High-Performance Computing

    … redistribution in distributed three-dimensional FFT computation and memory-mapping establishment in intra-node shared-memory communication. The first study examines the interaction between global data redistribution and local memory-access efficiency in parallel 3D FFT. An extension to the MPI …

    queens Repository record for Software Support for Efficient Data Movement and Memory Sharing in High-Performance Computing (opens in a new tab)

  10. Optimization Techniques for Mapping Algorithms and Applications onto CUDA GPU Platforms and CPU-GPU Heterogeneous Platforms

    … platforms. The Fast Fourier transform (FFT) constitutes a fundamental tool in computational science and engineering, and hence a GPU-optimized implementation is of paramount importance. We first study the mapping of the 3D FFT onto the recent, CUDA GPUs and develop a new approach that …

    maryland Repository record for Optimization Techniques for Mapping Algorithms and Applications onto CUDA GPU Platforms and CPU-GPU Heterogeneous Platforms (opens in a new tab)

  11. Paralelizace ultrazvukových simulací pomocí 2D dekompozice

    … výpočetně velice náročné. Simulace probíhají na 3D maticích, které reprezentují určité vlastnosti reálné tkáně, např. hustotu absorbce nebo rychlost šíření zvuku. K výpočtu gradientu se používá Rychlá Fourierova transformace (dále jen FFT), jejíž výpočet zabere zhruba 60% simulačního času. 3D FFT …

    brno-tech Repository record for Paralelizace ultrazvukových simulací pomocí 2D dekompozice (opens in a new tab)

  12. General Purpose Computation on Graphics Processing Units Using OpenCL

    … field with complexity of O(Nlog(N)) using FFT algorithm for discrete convolution is the main contribution towards the whole simulation time, and it is computed many times at each time step interval. This study and observation of magnetization behavior at sub-nanosecond time-scales is …

    poli-torino Repository record for General Purpose Computation on Graphics Processing Units Using OpenCL (opens in a new tab)

  13. Studies of turbulence structure and turbulent mixing using petascale computing

    … typically use transpose based three-dimensional (3D) Fast Fourier Transforms (FFT). The ALLTOALL type routines to perform global transposes have a quadratic dependence on message size and typically show limited scaling at very large problem sizes. A hybrid MPI/OpenMP 3D FFT kernel has been …

    gatech Repository record for Studies of turbulence structure and turbulent mixing using petascale computing (opens in a new tab)

  14. Electromagnetic Forward Modeling and Inversion for Geophysical Exploration

    … solved by the stabilized bi-conjugate gradient FFT (BCGS-FFT) method to give a rigorous and efficient modeling, the Bore iterative method along with the multiplicative regularization technique is used in the inversion through frequency hopping. In the inversion, to speed up the expensive …

    duke Repository record for Electromagnetic Forward Modeling and Inversion for Geophysical Exploration (opens in a new tab)

  15. Direct numerical simulation (DNS) for incompressible turbulent channel flow at Reτ = 5200

    Nearly all moving objects on Earth pass through fluids and many of them move at high speed. This makes high Re wall-bounded turbulent flows of great technological impor- tance. To study high Re wall-bounded turbulence, high spatial and temporal resolution is required due to the multi-scale nature …

    texas Repository record for Direct numerical simulation (DNS) for incompressible turbulent channel flow at Reτ = 5200 (opens in a new tab)

  16. Forward Modeling and Inversion of 3D Electromagnetic Scattering Problems in Complicated Backgrounds

    … Gradient Fast Fourier Transform (BCGS-FFT) has been developed to greatly reduce the computational complexity of the MoM, but so far this method is limited to objects located in a homogeneous background or in the same layer of a layered medium background. For those problems with objects …

    duke Repository record for Forward Modeling and Inversion of 3D Electromagnetic Scattering Problems in Complicated Backgrounds (opens in a new tab)

  17. Vibration-Based Health Monitoring of Rotating Systems with Gyroscopic Effect

    … the two gears was monitored and the 2D and 3D frequency spectrum, as well as the Wavelet Transform, were plotted in order to compare the individual defects. It was shown that the Wavelet Transform is a powerful tool, capable of identifying a cracked gear with a non-constant speed. The last …

    calpoly Repository record for Vibration-Based Health Monitoring of Rotating Systems with Gyroscopic Effect (opens in a new tab)

  18. Computational seismic interpretation using attention models, texture dissimilarity, and learning

    The exploration of oil and gas is a vital part of today's increasing power demands to meet the energy we need to power our homes, businesses, and transportation. Oil and gas explorers use seismic surveys, both onshore and offshore, to produce detailed images of the various rock types, layers, and …

    gatech Repository record for Computational seismic interpretation using attention models, texture dissimilarity, and learning (opens in a new tab)