本文讨论超立方体结构上的并行归并排序算法，着重分析算法的通信复杂性，在此基础上推导算法的加速比。
This paper discusses the parallel merging sorting algorithm for hypercube architecture. Based on the analysis of communication complexity, the speedup of this algorithm is derived.
本文讨论超立方体结构上的并行fft算法，着重分析算法的通信复杂性，并在此基础上导出算法的加速比。
This paper discusses the parallel FFT algorithm on the hypercube architecture. Based on the analysis of the communication complexity, the speedup of the algorithm is derived.
比较环和网状结构，超立方体上的并行fft算法具有更好的性能。
Comparing with the ring or the mesh architecture, the parallel FFT algorithm on the hypercube is found to have better performances.
经研究表明，并行fft算法的最佳体系结构为超立方体。
The result of research shows that the best architecture of the parallel FFT algorithm is hypercube architecture.
经研究表明，并行fft算法的最佳体系结构为超立方体。
The result of research shows that the best architecture of the parallel FFT algorithm is hypercube architecture.
应用推荐