Parallel fast fourier transform in SPMD style of cilk

Weng, TH; Wang, TX; Hsieh, MY; Jiang, H; Shen, J; Li, KC

Parallel fast fourier transform in SPMD style of cilk

Weng, TH Wang, TX Hsieh, MY Jiang, H Shen, J

Li, KC

Permalink

Publisher:: Inderscience Publishers
Publication Type:: Journal Article
Citation:: International Journal of Embedded Systems, 2019, 11, (6), pp. 778-787
Issue Date:: 2019-01-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published versionAdobe PDF (763.04 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Weng, TH
dc.contributor.author	Wang, TX
dc.contributor.author	Hsieh, MY
dc.contributor.author	Jiang, H
dc.contributor.author	Shen, J https://orcid.org/0000-0002-9403-7140
dc.contributor.author	Li, KC
dc.date.accessioned	2020-05-07T06:20:14Z
dc.date.available	2020-05-07T06:20:14Z
dc.date.issued	2019-01-01
dc.identifier.citation	International Journal of Embedded Systems, 2019, 11, (6), pp. 778-787
dc.identifier.issn	1741-1068
dc.identifier.issn	1741-1076
dc.identifier.uri	http://hdl.handle.net/10453/140545
dc.description.abstract	Copyright © 2019 Inderscience Enterprises Ltd. 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.
dc.language	en
dc.publisher	Inderscience Publishers
dc.relation.ispartof	International Journal of Embedded Systems
dc.relation.isbasedon	10.1504/IJES.2019.103998
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	1006 Computer Hardware
dc.title	Parallel fast fourier transform in SPMD style of cilk
dc.type	Journal Article
utslib.citation.volume	11
utslib.for	1006 Computer Hardware
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Information, Systems and Modelling
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	open_access	*
pubs.consider-herdc	false
dc.date.updated	2020-05-07T06:20:11Z
pubs.issue	6
pubs.publication-status	Published
pubs.volume	11
utslib.start-page	778
utslib.citation.issue	6

Abstract:

Copyright © 2019 Inderscience Enterprises Ltd. 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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/140545