2009 · 360 citations · 32 references
ComputingComputer ScienceHigh-performance ComputingAlgorithmsComputer ArchitectureParallel ComputingAlgorithm AnalysisData ParallelismParallel Algorithm DesignParallel ArchitecturesParallel Computer ArchitectureParallel Computing SystemsAutomatic ParallelizationCompiler DesignGranularityGranularity ControlHigh PerformanceParallelization
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when considering different choices for data distributions, parallelism, transformations, and blocking. The best solution to these choices is often tightly coupled to different architectures, problem sizes, data, and available system resources. In some cases, completely different algorithms may provide the best performance. Current compiler and programming language techniques are able to change some of these parameters, but today there is no simple way for the programmer to express or the compiler to choose different algorithms to handle different parts of the data. Existing solutions normally can handle only coarse-grained, library level selections or hand coded cutoffs between base cases and recursive cases.
32
The Design and Implementation of FFTW3
Matteo Frigo, Steven G. Johnson · Proceedings of the IEEE · 2005 · 5.2K citations
Samuel Williams, Andrew Waterman, David A. Patterson · Communications of the ACM · 2009 · 2.4K citations · Full text
Applied numerical linear algebra
Choice Reviews Online · 1998 · 2.2K citations
FFTW: an adaptive software architecture for the FFT
Matteo Frigo, Steven G. Johnson · 2002 · 1.8K citations