Parallel fast Fourier transform in SPMD style of Cilk

Jun Shen, Hai Jiang, Meng-Yen Hsieh, T. Weng, Kuan-Ching Li, Teng Xian Wang
{"title":"Parallel fast Fourier transform in SPMD style of Cilk","authors":"Jun Shen, Hai Jiang, Meng-Yen Hsieh, T. Weng, Kuan-Ching Li, Teng Xian Wang","doi":"10.1504/ijhpcn.2018.10017004","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a parallel one-dimensional non-recursive fast Fourier transform (FFT) program based on conventional Cooley-Tukey's algorithm written in C using Cilk in single program multiple data (SPMD) style. As a highly compact designed code, this code is compared with a highly tuned parallel recursive fast Fourier transform (FFT) using Cilk, which is included in Cilk package of version 5.4.6. Both algorithms are executed on multicore servers, and experimental results show that the performance of the SPMD style of Cilk fast Fourier transform (FFT) parallel code is highly competitive and promising.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Embed. Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijhpcn.2018.10017004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we propose a parallel one-dimensional non-recursive fast Fourier transform (FFT) program based on conventional Cooley-Tukey's algorithm written in C using Cilk in single program multiple data (SPMD) style. As a highly compact designed code, this code is compared with a highly tuned parallel recursive fast Fourier transform (FFT) using Cilk, which is included in Cilk package of version 5.4.6. Both algorithms are executed on multicore servers, and experimental results show that the performance of the SPMD style of Cilk fast Fourier transform (FFT) parallel code is highly competitive and promising.
并行快速傅里叶变换的SPMD风格的Cilk
本文提出了一种基于传统Cooley-Tukey算法的并行一维非递归快速傅里叶变换(FFT)程序,该程序采用C语言编写,使用Cilk以单程序多数据(SPMD)方式实现。作为一个高度紧凑的设计代码,该代码与使用Cilk的高度调优的并行递归快速傅里叶变换(FFT)进行了比较,Cilk包含在版本5.4.6的Cilk包中。两种算法都在多核服务器上运行,实验结果表明SPMD风格的Cilk快速傅里叶变换(FFT)并行代码的性能具有很强的竞争力和前景。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信