首页> 外文期刊>Parallel Computing >A simple and efficient parallel FFT algorithm using the BSP model
【24h】

A simple and efficient parallel FFT algorithm using the BSP model

机译:使用BSP模型的简单高效的并行FFT算法

获取原文
获取原文并翻译 | 示例

摘要

ew present a new parallel radix-4 FFT algorithm based on the BSP model. Our parallel algorithm uses the group-cyclic distribution family, which makes it simple to understand and easy to implement. We show how to reduce the communication cost of the algorithm by a factor of 3, in the case that the input/output vector is in the cyclic distribution. We also show how to reduce computation time on computers with a cache-based architecture. We present performance results on a Cray T3E with up to 64 processors, obtaining reasonable efficiency levels for local problem sizes as small as 256 and very good efficiency levels for local sizes larger than 2048.
机译:ew提出了一种基于BSP模型的新的并行基数4 FFT算法。我们的并行算法使用族循环分布族,这使得它易于理解和易于实现。我们展示了在输入/输出矢量处于循环分布的情况下,如何将算法的通信成本降低三倍。我们还将展示如何减少具有基于缓存的体系结构的计算机上的计算时间。我们在具有多达64个处理器的Cray T3E上显示了性能结果,对于最小到256的局部问题,获得了合理的效率水平,对于大于2048的局部问题,获得了非常好的效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号