The purpose of this paper is to investigate the parallelization of one-dimensional Fast Hartley Transform (FHT) algorithm on shared memory multiprocessor systems. The computational dependencies of the sequential FHT algorithm are analyzed, in order to distribute the loops of the algorithm among multiple processes (threads), executed on the available processors of the system. The outer loop of the algorithm carries data dependencies between consecutive iterations and, for parallel execution, synchronization barriers are introduced. The results show that in the parallel execution of the FHT algorithm a significant speed-up is obtained and that the speed-up increases with the size of the input sequence.
|Title of host publication||Euro-Par 2000, parallel processing : proceedings 6th international Euro-Par conference, Munich, Germany, august 29-september 1, 2000|
|Editors||A. Bode, T. Ludwig, W. Karl, R. Wismüller|
|Place of Publication||Berlin|
|Publication status||Published - 2000|
|Name||Lecture Notes in Computer Science|