Skip to Main content Skip to Navigation
Reports

Faster Fourier Transforms via Automatic Program Specialization

Abstract : Because of its wide applicability, many efficient implementations of the Fast Fourier Transform have been developed. In this paper we propose that efficient implementations can be produced automatically and reliably by partial evaluation. Partial evaluation of an unoptimized implementation produces a speedup of over 7 times. The automatically generated result of partial evaluation has performance comparable to or exceeding that produced by a variety of hand optimizations. We analyze the benefits of partial evaluation at both compile time and run time, and survey related hand-optimization techniques.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00073253
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 12:21:18 PM
Last modification on : Wednesday, November 29, 2017 - 4:24:56 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:39:46 PM

Identifiers

  • HAL Id : inria-00073253, version 1

Collections

Citation

Julia Lawall. Faster Fourier Transforms via Automatic Program Specialization. [Research Report] RR-3437, INRIA. 1998. ⟨inria-00073253⟩

Share

Metrics

Record views

157

Files downloads

264