A Prototypical Self-Optimizing Package for Parallel Implementation of Fast Signal Transforms

Authors:
Kang Chen;J. R. Johnson
Affiliations:
-;-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 6
Cited 1

A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures

Circuits, Systems, and Signal Processing
Parallel programming in OpenMP

Parallel programming in OpenMP
Stochastic search for signal processing algorithm optimization

Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Faster FFTs via Architecture-Cognizance

PACT '00 Proceedings of the 2000 International Conference on Parallel Architectures and Compilation Techniques
In search of the optimal Walsh-Hadamard transform

ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06
Cache conscious Walsh-Hadamard transform

ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02

Automated performance tuning

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a self-adapting parallel package for computing the Walsh-Hadamard transform (WHT), a prototypical fast signal transform, similar to the fast Fourier transform. Using a search over a space of mathematical formulas representing different algorithms to compute the WHT, the package finds the best parallel implementation on a given shared-memory multiprocessor. The search automatically finds the best combination of sequential and parallel code leading to the effective granularity, load balance, and cache utilization. Experimental results are presented showing the optimizations required to obtain nearly linear speedup on a sample symmetric multiprocessor.