On the abstracted dataflow complexity of Fast Fourier Transforms [electronic resource].
- Published:
- Washington, D.C. : United States. Dept. of Energy, 1992.
Oak Ridge, Tenn. : Distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy. - Physical Description:
- 21 pages : digital, PDF file
- Additional Creators:
- Los Alamos National Laboratory, United States. Department of Energy, and United States. Department of Energy. Office of Scientific and Technical Information
Access Online
- Restrictions on Access:
- Free-to-read Unrestricted online access
- Summary:
- In this paper we develop and analyze the simulated performance of codes for the Fast Fourier Transform written in If and targeted for execution on Motorola`s dataflow machine Monsoon. The FFT application is of interest because of its computational parallelism, its requirement for global communications, and its array element data dependences. We use the parallel profiling simulator Id World to study the dataflow performance of various implementations. Our approach is comparative. We study two approaches, a recursive and an iterative one, and in each version we examine the effect of a variety of implementations. We contend that only through such comparative evaluations can significant insight be gained in understanding the computational and structural details of functional algorithms.
- Report Numbers:
- E 1.99:la-ur--92-805
E 1.99: conf-920730--3
conf-920730--3
la-ur--92-805 - Subject(s):
- Other Subject(s):
- Note:
- Published through SciTech Connect.
05/01/1992.
"la-ur--92-805"
" conf-920730--3"
"DE92011372"
ACM SIGARCH international conference on supercomputing,Washington, DC (United States),19-24 Jul 1992.
Ashley, J.M.; Kelly, K.A.; Boehm, A.P.W.; Hiromoto, R.E. - Funding Information:
- W-7405-ENG-36
View MARC record | catkey: 14355521