Subscribe

Issue No.05 - May (1994 vol.5)

pp: 525-531

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.282562

ABSTRACT

<p>The n-star graph, denoted by S/sub n/, is one of the graph networks that have beenrecently proposed as attractive alternatives to the n-cube topology for interconnectingprocessors in parallel computers. We present a parallel algorithm for the computation ofthe Fourier transform on the star graph. The algorithm requires O(n/sup 2/) multiply-addsteps for an input sequence of n! elements, and is hence cost-optimal with respect tothe sequential algorithm on which it is based. This is believed to be the first algorithm,and the only one to date, for the computation of the Fourier transform on the star graph.</p>

INDEX TERMS

Index TermsFourier transforms; multiprocessor interconnection networks; graph theory; parallelalgorithms; computational complexity; parallel algorithm; Fourier transforms; star graph;interconnecting processors; parallel computers

CITATION

P. Fragopoulou, S.G. Akl, "A Parallel Algorithm for Computing Fourier Transforms on the Star Graph",

*IEEE Transactions on Parallel & Distributed Systems*, vol.5, no. 5, pp. 525-531, May 1994, doi:10.1109/71.282562