arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.6915cs.DC
收藏

使用Hadoop和CUDA加速快速傅立叶变换

Accelerating Fast Fourier Transforms Using Hadoop and CUDA

Rostislav Tsiomenko, Bradley S. Rees

摘要:

已经有相当多的研究通过并行化和优化专用硬件来提高快速傅立叶变换(FFT)的性能。然而,即使有了这些进步,处理超过1TB的超大文件仍然非常缓慢。执行信号处理的分析师被迫等待数小时或数天的结果,这导致其工作流程中断和生产力下降。在本文中,我们提出了一种独特的方法,不仅并行的工作负载在多核,但分布在一个集群的图形处理单元(GPU)配备的服务器的问题。通过使用Hadoop和CUDA,我们可以利用廉价的服务器,同时仍然超过专用超级计算机的处理能力,正如我们使用Amazon EC2的结果所示。

英文摘要:

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 multi-cores, but distributes the problem over a cluster of graphics processing unit (GPU)-equipped servers. By utilizing Hadoop and CUDA, 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑