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.
Type de document :
Rapport
[Research Report] RR-3437, INRIA. 1998
Liste complète des métadonnées

https://hal.inria.fr/inria-00073253
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:21:18
Dernière modification le : mercredi 29 novembre 2017 - 16:24:56
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:39:46

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

121

Téléchargements de fichiers

97