基于网格的并行FFT计算研究  

Research of Parallel FFT Computing Based on Grid

作　　者：陈小飞[1] 徐宏炳[1] 

机构地区：[1]东南大学计算机科学与工程学院,江苏南京210096

出　　处：《计算机技术与发展》2008年第3期67-70,共4页Computer Technology and Development

摘　　要：快速傅里叶变换(FFT)在科学和工程领域有着广泛的应用。在网格环境下进行并行FFT计算可以提高运算速度,促进FFT的应用。在介绍了网格计算发展状况的基础上,详细阐述了基于网格的分布式并行计算。实验以FFT算法为背景,在Globus Toolkit 4平台下实现了并行FFT计算,并对实验数据作了分析,说明了基于网格的并行FFT计算的可行性。最后指出网格资源调度对并行计算的重要性。Fast Fourier Transform（FFT） is widely used in the science and engineering fields. Parallel FFT computing based on grid can improve computational speed and promote the use of FFT. lntrcduces the development of grid computing, then explicates distributed parallel computing based on grid. Taking FFT algorithm as backdrop, the experiment implements parallel FFT computing on the Globus Toolkit 4 platform, and analyses the experiment data, and then dernonstrates the feasibility of parallel FFT computing based on grid. In the last, point out that grid resource scheduling is great importance to parallel computing.

关 键 词：网格 并行计算 GLOBUS Toolkit4 FFT 资源调度 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]