期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Parallel FFT Algorithm on Computer Clusters
1
作者 YU Xiu-min 《Journal of Northeast Agricultural University(English Edition)》 CAS 2005年第2期160-162,共3页
DFT is widely applied in the field of signal process and others. Most present rapid ways of calculation are either based on paralleled computers connected by such particular systems like butterfly network, hypercube e... DFT is widely applied in the field of signal process and others. Most present rapid ways of calculation are either based on paralleled computers connected by such particular systems like butterfly network, hypercube etc; or based on the assumption of instant transportation, non-conflict communication, complete connection of paralleled processors and unlimited usable processors. However, the delay of communication in the system of information transmission cannot be ignored. This paper works on the following aspects: instant transmission, dispatching missions, and the path of information through the communication link in the computer cluster systems; layout of the dynamic FFT algorithm under the different structures of computer clusters. 展开更多
关键词 fast fourier transform FFT) computer clusters ALGORITHM
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部