集群系统中BSP模型上的并行FFT设计

DESIGN OF FFT PARALLEL ALGORITHMS ON BSP MODEL IN NOWS

在并行计算模型中 ,BSP模型由于具有编程简单、独立于体系结构和执行性能可预测等特点而在总体上优于其它模型。NOWs正成为并行计算领域的一个新的发展热点 ,以太网构成的微机集群系统是NOWs的一种重要实现形式。文中研究了集群系统中BSP模型上的并行算法设计 ,以FFT算法为例 ,进行了设计和分析 ,并给出了测试结果。

Of the parallel computation models, BSP model is superior to others for it′s simply program design, independence of architecture and predictable execution performance. NOWs is a new hot spot in parallel computation now, and the cluster system of PCs on Ethernet is one of it′s basic realization. This paper is concerned with the design of parallel algorithms in the cluster system on Ethernet. Taking FFT algorithm as an example, the design and analysis are presented