The Community for Technology Leaders
Parallel Computing in Electrical Engineering, 2004. International Conference on (2002)
Warsaw, Poland
Sept. 22, 2002 to Sept. 25, 2002
ISBN: 0-7695-1730-7
pp: 299
Przemysław Stpiczyński , Marie Curie-Sklodowska University
ABSTRACT
In this paper we present new parallel versions of sequential Goertzel and Reinsch algorithms for calculating trigonometric sums. The new algorithms use a recently introduced, very efficient BLAS-based algorithm for solving linear recurrence systems with constant coefficients. To achieve their portability across different shared-memory parallel architectures, the algorithms have been implemented in Fortran 77 and OpenMP. We also present experimental results performed on a two processor Pentium III computer running under Linux operating system with Atlas as an efficient implementation of BLAS. The new algorithms are up to 60-90% faster than the equivalent sequential Goertzel and Reinsch algorithms, even on one processor.
INDEX TERMS
null
CITATION
Przemysław Stpiczyński, "Fast Parallel Algorithms for Computing Trigonometric Sums", Parallel Computing in Electrical Engineering, 2004. International Conference on, vol. 00, no. , pp. 299, 2002, doi:10.1109/PCEE.2002.1115276
94 ms
(Ver 3.3 (11022016))