A Parallel Algorithm for Computing Fourier Transforms on the Star Graph

Authors:
P. Fragopoulou;S. G. Akl
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1994

Citing 5
Cited 13

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
The design and analysis of parallel algorithms

The design and analysis of parallel algorithms
Decomposing a star graph into disjoint cycles

Information Processing Letters
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Multi-dimensional systolic networks, for discrete fourier transform

ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture

Two Ranking Schemes for Efficient Computation on the Star Interconnection Network

IEEE Transactions on Parallel and Distributed Systems
Matrix Decomposition on the Star Graph

IEEE Transactions on Parallel and Distributed Systems
A parallel algorithm for Lagrange interpolation on the star graph

Journal of Parallel and Distributed Computing
Low Expansion Packings and Embeddings of Hypercubes into Star Graphs: A Performance-Oriented Approach

IEEE Transactions on Parallel and Distributed Systems
Reliable Communication in Faulty Star Networks

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
On the topological properties of the arrangement-star network

Journal of Systems Architecture: the EUROMICRO Journal
The shortest routing path in star graphs with faulty clusters

PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Node-ranking schemes for the star networks

Journal of Parallel and Distributed Computing
A faster algorithm for solving linear algebraic equations on the star graph

Journal of Parallel and Distributed Computing
Hyper hamiltonian laceability on edge fault star graph

Information Sciences: an International Journal
Performance Comparison of Adaptive Routing Algorithms in the Star Network

HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
OTIS-star an attractive alternative network

SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Largest connected component of a star graph with faulty vertices

International Journal of Computer Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.