Skip to main content

A Blocking Algorithm for Parallel 1-D FFT on Shared-Memory Parallel Computers

  • Conference paper
  • First Online:
Applied Parallel Computing (PARA 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2367))

Included in the following conference series:

  • 535 Accesses

Abstract

In this paper, we propose a blocking algorithm for parallel one-dimensional fast Fourier transform (FFT) on shared-memory parallel computers. Our proposed FFT algorithm is based on the six-step FFT algorithm. The block six-step FFT algorithm improves performance by effectively utilizing the cache memory. Performance results of one-dimensional FFTs on the SGI Onyx 3400 and Sun Enterprise 6000 are reported. We successfully achieved performance of about 1929 MFLOPS on the SGI Onyx 3400 (MIPS R12000 400 MHz, 16 CPUs) and about 520 MFLOPS on the Sun Enterprise 6000 (UltraSPARC 168 MHz, 16 CPUs).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19 (1965) 297–301

    Article  MathSciNet  MATH  Google Scholar 

  2. Swarztrauber, P.N.: Multiprocessor FFTs. Parallel Computing 5 (1987) 197–210

    Article  MathSciNet  MATH  Google Scholar 

  3. Bailey, D.H.: FFTs in external or hierarchical memory. The Journal of Supercomputing 4 (1990) 23–35

    Article  Google Scholar 

  4. Van Loan, C.: Computational Frameworks for the Fast Fourier Transform. SIAM Press, Philadelphia, PA (1992)

    Book  MATH  Google Scholar 

  5. Wadleigh, K.R., Gostin, G.B., Liu, J.: High-performance FFT algorithms for the Convex C4/XA supercomputer. The Journal of Supercomputing 9 (1995) 163–178

    Article  Google Scholar 

  6. Frigo, M., Johnson, S.G.: The fastest Fourier transform in the west. Technical Report MIT-LCS-TR-728, MIT Laboratory for Computer Science (1997)

    Google Scholar 

  7. Wadleigh, K.R.: High performance FFT algorithms for cache-coherent multiprocessors. The International Journal of High Performance Computing Applications 13 (1999) 163–171

    Article  Google Scholar 

  8. Cochrane, W.T., Cooley, J.W., Favin, D.L., Helms, H.D., Kaenel, R.A., Lang, W.W., Maling, Jr., G.C., Nelson, D.E., Rader, C.M., Welch, P.D.: What is the fast Fourier transform? IEEE Trans. Audio Electroacoust. 15 (1967) 45–55

    Article  Google Scholar 

  9. Swarztrauber, P.N.: FFT algorithms for vector computers. Parallel Computing 1 (1984) 45–63

    Article  MATH  Google Scholar 

  10. Takahashi, D.: High-performance parallel FFT algorithms for the HITACHI SR8000. In: Proc. Fourth International Conference/Exhibition on High Performance Computing in Asia-Pacific Region (HPC-Asia 2000). (2000) 192–199

    Google Scholar 

  11. OpenMP: Simple, Portable, Scalable SMP Programming. (http://www.openmp.org)

  12. Frigo, M., Johnson, S.G.: Fftw. (http://www.fftw.org)

  13. Omni: RWCP Omni OpenMP Compiler Project. (http://www.hpcc.jp/Omni/)

  14. Takahashi, D.: An extended split-radix FFT algorithm. IEEE Signal Processing Letters 8 (2001) 145–147

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Takahashi, D. (2002). A Blocking Algorithm for Parallel 1-D FFT on Shared-Memory Parallel Computers. In: Fagerholm, J., Haataja, J., Järvinen, J., Lyly, M., Råback, P., Savolainen, V. (eds) Applied Parallel Computing. PARA 2002. Lecture Notes in Computer Science, vol 2367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48051-X_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-48051-X_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43786-4

  • Online ISBN: 978-3-540-48051-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics