Efficient 2D FFT implementation on mediaprocessors

Mermer, Coskun; Kim, Donglok; Kim, Yongmin

doi:10.1016/s0167-8191(03)00040-1

Cited by 18 publications

(4 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is observed that the research on parallel FFT is a fast developed field (e.g. see [28][29][30][31], or a relatively complete review in [32]). It is difficult to rank the available FFTs, since there are so many different versions of FFTs, different parallel schemes for the FFTs, and different parallel computers to implement them.…”

Section: A Brief Discussion For the Pfft Schemementioning

confidence: 99%

A new parallel strategy for two-dimensional incompressible flow simulations using pseudo-spectral methods

Yin

Tang

2005

Journal of Computational Physics

View full text Add to dashboard Cite

A novel parallel technique for Fourier-Galerkin pseudo-spectral methods with applications to two-dimensional Navier-Stokes equations and inviscid Boussinesq approximation equations is presented. It takes advantage of the programming structure of the phase-shift de-aliased scheme for pseudo-spectral codes, and combines the task-distribution strategy [Z. Yin, H.J.H. Clercx, D.C. Montgomery, An easily implemented task-based parallel scheme for the Fourier pseudo-spectral solver applied to 2D Navier-Stokes turbulence, Comput. Fluid 33 (2004) 509] and parallelized Fast Fourier Transform scheme. The performances of the resulting MPI Fortran90 codes with the new procedure on SGI 3800 are reported. For fixed resolution of the same problem, the peak speed of the new scheme can be twice as fast as the old parallel methods. The parallelized codes are used to solve some challenging numerical problems governed by the Navier-Stokes equations and the Boussinesq equations. Two interesting physical problems, namely, the double-valued x-w structure in two-dimensional decaying turbulence and the collapse of the bubble cap in the Boussinesq simulation, are solved by using the proposed parallel algorithms.

show abstract

Section: A Brief Discussion For the Pfft Schemementioning

confidence: 99%

A new parallel strategy for two-dimensional incompressible flow simulations using pseudo-spectral methods

Yin

Tang

2005

Journal of Computational Physics

View full text Add to dashboard Cite

show abstract

“…INSPIRE recursively adopts a 2D NTT algorithm to achieve such mapping [41]. The key idea of 2D NTT is that we can break down a length-𝐿 = 𝑚 × 𝑛 NTT into smaller length NTTs, by performing length-𝑚 NTT 𝑛 times and performing length-𝑛 NTT 𝑚 times.…”

Section: Recursive Ntt Unitmentioning

confidence: 99%

Inspire

Lin

Liang

et al. 2022

Proceedings of the 49th Annual International Symposium on Computer Architecture

View full text Add to dashboard Cite

Private Information Retrieval (PIR) plays a vital role in secure, database-centric applications. However, existing PIR protocols explore a massive working space containing hundreds of GiBs of query and database data. As a consequence, PIR performance is severely bounded by storage communication, making it far from practical for real-world deployment.In this work, we describe INSPIRE, an accelerator for IN-Storage Private Information REtrieval. INSPIRE follows a protocol and architecture co-design approach. We first design the INSPIRE protocol with a multi-stage filtering mechanism, which achieves a constant PIR query size. For a 1-billion-entry database of size 288GiB, IN-SPIRE's protocol reduces the query size from 27GiB to 3.6MiB. Further, we propose the INSPIRE hardware, a heterogeneous instorage architecture, which integrates our protocol across the SSD hierarchy. Together with the INSPIRE protocol, the INSPIRE hardware reduces the query time from 28.4min to 36s, relative to the the state-of-the-art FastPIR scheme. CCS CONCEPTS• Hardware → Memory and dense storage; • Security and privacy → Data anonymization and sanitization.

show abstract

“…By contrast, we could rapidly obtain the output responses in another way, which avoids solving equations directly. In that way, we firstly sample points in the output responses, and then recover the output responses through fast Fourier transform (FFT) [6][7][8]. The FFT plays a significant role in signal processing and recovering.…”

Section: Introductionmentioning

confidence: 99%

An efficient technique for recovering responses of parameterized structural dynamic problems

2011

View full text Add to dashboard Cite

In this article, an effective technique is developed to efficiently obtain the output responses of parameterized structural dynamic problems. This technique is based on the conception of reduced basis method and the usage of linear interpolation principle. The original problem is projected onto the reduced basis space by linear interpolation projection, and subsequently an associated interpolation matrix is generated. To ensure the largest nonsingularity, the interpolation matrix needs to go through a timenode choosing process, which is developed by applying the angle of vector spaces. As a part of this technique, error estimation is recommended for achieving the computational error bound. To ensure the successful performance of this technique, the offline-online computational procedures are conducted in practical engineering. Two numerical examples demonstrate the accuracy and efficiency of the presented method.

show abstract

Efficient 2D FFT implementation on mediaprocessors

Cited by 18 publications

References 26 publications

A new parallel strategy for two-dimensional incompressible flow simulations using pseudo-spectral methods

A new parallel strategy for two-dimensional incompressible flow simulations using pseudo-spectral methods

Inspire

An efficient technique for recovering responses of parameterized structural dynamic problems

Contact Info

Product

Resources

About