Parallel implementation of Fast Hartley Transform (FHT) in multiprocessor systems (Research Note)

F. Ionescu, A.C. Jalba, M.F. Ionescu

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Abstract

    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.
    Original languageEnglish
    Title of host publicationEuro-Par 2000, parallel processing : proceedings 6th international Euro-Par conference, Munich, Germany, august 29-september 1, 2000
    EditorsA. Bode, T. Ludwig, W. Karl, R. Wismüller
    Place of PublicationBerlin
    PublisherSpringer
    Pages532-536
    ISBN (Print)3-540-67956-1
    DOIs
    Publication statusPublished - 2000

    Publication series

    NameLecture Notes in Computer Science
    Volume1900
    ISSN (Print)0302-9743

    Fingerprint

    Dive into the research topics of 'Parallel implementation of Fast Hartley Transform (FHT) in multiprocessor systems (Research Note)'. Together they form a unique fingerprint.

    Cite this