(Enter summary)
Abstract: In this paper we present an adaptive and portable software
library for the fast Fourier transform (FFT). The library
consists of a number of composable blocks of code called
codelets, each computing a part of the transform. The actual
FFT algorithm used by the code is determined at run-time
by selecting the fastest strategy among all possible strategies,
given available codelets, for a given transform size. We
also presentanefficient automatic method of generating the
library modules by using a ... (Update)
Context of citations to this paper: More
.... generation of application information and performance models [24] as well as the inclusion of such models in Grid enabled libraries [24, 29]. As this work matures, we plan to experiment with the usage of such models for application scheduling. 5.3. Conclusions In this paper...
Cited by: More
Performance Tuning and Analysis of Sparse Triangular Solve .. - Richie Bebop Computer (2002)
(Correct)
Performance Optimizations and Bounds for Sparse.. - Vuduc, Demmel, Yelick (2002)
(Correct)
Memory Hierarchy Optimizations and Performance Bounds.. - Vuduc, Gyulassy.. (2003)
(Correct)
Similar documents (at the sentence level):
45.5%: An Adaptive Software Library For Fast Fourier Transforms - Mahasoom (1999)
(Correct)
Active bibliography (related documents): More All
0.3: Optimizing Locality for ODE Solvers - Rauber, Rünger
(Correct)
0.3: Optimizing Main-Memory Join On Modern Hardware - Manegold, Boncz, Kersten (1999)
(Correct)
0.2: A Methodology for Designing, Modifying, and.. - Johnson, Johnson.. (1990)
(Correct)
Similar documents based on text: More All
0.7: Transactional Rollback for Language-Based Systems - Rudys, Wallach (2002)
(Correct)
0.2: A Comprehensive DFT API for Scientific Computing - Tang
(Correct)
0.2: WebLQM: A Web Community Examiner - Jess Ubaldo Quevedo
(Correct)
Related documents from co-citation: More All
4: FFTW: An adaptive software architecture for the FFT
- Frigo, Johnson - 1998
3: Characterizing the Behavior of Sparse Algorithms on Caches
- Temam, Jalby - 1992
3: On improving the performance of sparse matrix-vector multiplication
- White, Sadayappan - 1997
BibTeX entry: (Update)
MIRKOVIC, D., MAHASOOM, R., AND JOHNSSON, L. An adaptive software library for fast fourier transforms. In Proceedings of the 2000. http://citeseer.ist.psu.edu/mirkovic00adaptive.html More
@inproceedings{ mirkovic00adaptive,
author = "Dragan Mirkovic and Rishad Mahasoom and S. Lennart Johnsson",
title = "An adaptive software library for fast Fourier transforms",
booktitle = "International Conference on Supercomputing",
pages = "215-224",
year = "2000",
url = "citeseer.ist.psu.edu/mirkovic00adaptive.html" }
Citations (may not include all citations):
64
An algorithm for the machine computation of complex fourier .. (context) - Cooley, Tukey - 1965
62
Computational frameworks for the fast Fourier transform (context) - Van Loan - 1992
42
Intel Corporation (context) - Optimization, Manual - 1999
23
Discrete fourier transforms when the number of data samples .. (context) - Rader - 1968
22
Split Radix FFT Algorithms (context) - Duhamel, Hollmann - 1984
18
The Fastest Fourier Transform in the West
- Frigo, Johnson - 1997
4
A Note on Prime Factor FFT Algorithms (context) - Temperton - 1983
4
MIPS Technologies (context) - Microprocessor - 1996
3
PCL: The Performance Counter Library (context) - Berrendorf, Ziegler - 1999
1
Fast Fourier Transforms: ATutorial Review and a State of the.. (context) - Duhamel, Vetterli - 1990
1
Hewlett-Packard (context) - Guide - 1997
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC