Cart (Loading....) | Create Account
Close category search window

Exploiting Data Locality in FFT Using Indirect Swap Network on Cell/B.E.

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Meilian Xu ; Dept. of Comput. Sci., Univ. of Manitoba, Winnipeg, MB ; Thulasiraman, P. ; Thulasiram, R.K.

Communication and synchronization are two main latency issues in computing FFT on parallel architectures. Both latencies have to be either hidden or tolerated to achieve high performance. One approach to achieve this is by multithreading. Another approach to tolerate latency is to map data efficiently onto the processors' local memory and exploiting data locality. Indirect swap networks, an idea proposed in VLSI circuits can be efficiently used to compute the butterfly computations in FFT. Data mapping in the swap network topology reduces the communication overhead by half at each iteration. Cell broadband engine (Cell/B.E.)processor is a heterogeneous multicoreprocessor for stream data applications and high performance computing. Its eight SIMD processing elements, synergistic processor elements (SPEs), provide multi-folded parallelism. In this paper, we investigate the improved Cooley-Tukey FFT algorithm based on indirect swap network, and design the parallel algorithm taking into consideration all the features of the Cell/B.E. architecture. The performance results show that the new algorithm on Cell/B.E. is 3.7 faster than the cluster for 4K input data size and 6.4 faster than the cluster for 16K input data size at the processor level.

Published in:

High Performance Computing Systems and Applications, 2008. HPCS 2008. 22nd International Symposium on

Date of Conference:

9-11 June 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.