8825

Accelerating Fast Fourier Transforms Using Hadoop and CUDA

Rostislav Tsiomenko, Bradley S. Rees
SAIC, Columbia, Md., USA
The 33rd International Conference on Distributed Computing Systems (ICDCS’13), 2013
@article{tsiomenko2013accelerating,

   title={Accelerating Fast Fourier Transforms Using Hadoop{textregistered} and CUDA{textregistered}},

   author={Tsiomenko, R. and Rees, B.S.},

   year={2013}

}

Download Download (PDF)   View View   Source Source   

1947

views

There has been considerable research into improving Fast Fourier Transform (FFT) performance through parallelization and optimization for specialized hardware. However, even with those advancements, processing of very large files, over 1TB in size, still remains prohibitively slow. Analysts performing signal processing are forced to wait hours or days for results, which results in a disruption of their workflow and a decrease in productivity. In this paper we present a unique approach that not only parallelizes the workload over multicores, but distributes the problem over a cluster of graphics processing unit (GPU)-equipped servers. By utilizing Hadoop (The Apache Software Foundation) and CUDA (NVIDIA Corporation), we can take advantage of inexpensive servers while still exceeding the processing power of a dedicated supercomputer, as demonstrated in our result using Amazon EC2 (Amazon Technologies, Inc.).
VN:F [1.9.22_1171]
Rating: 4.0/5 (2 votes cast)
Accelerating Fast Fourier Transforms Using Hadoop and CUDA, 4.0 out of 5 based on 2 ratings
  • corbomite

    Interesting site – instead of the papers I get advertisements. Thanks for nothing.

  • hgpu

    Authors of the paper withdrawn it and close the authors site.
    The paper is unavailable now in the Internet.
    Sorry for inconvenience.

* * *

* * *

Follow us on Twitter

HGPU group

1863 peoples are following HGPU @twitter

Like us on Facebook

HGPU group

406 people like HGPU on Facebook

HGPU group © 2010-2016 hgpu.org

All rights belong to the respective authors

Contact us: