
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
P. Fragopoulou, S.G. Akl, "A Parallel Algorithm for Computing Fourier Transforms on the Star Graph," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 5, pp. 525531, May, 1994.  
BibTex  x  
@article{ 10.1109/71.282562, author = {P. Fragopoulou and S.G. Akl}, title = {A Parallel Algorithm for Computing Fourier Transforms on the Star Graph}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {5}, number = {5}, issn = {10459219}, year = {1994}, pages = {525531}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.282562}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A Parallel Algorithm for Computing Fourier Transforms on the Star Graph IS  5 SN  10459219 SP525 EP531 EPD  525531 A1  P. Fragopoulou, A1  S.G. Akl, PY  1994 KW  Index TermsFourier transforms; multiprocessor interconnection networks; graph theory; parallelalgorithms; computational complexity; parallel algorithm; Fourier transforms; star graph;interconnecting processors; parallel computers VL  5 JA  IEEE Transactions on Parallel and Distributed Systems ER   
The nstar graph, denoted by S/sub n/, is one of the graph networks that have beenrecently proposed as attractive alternatives to the ncube 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/) multiplyaddsteps for an input sequence of n! elements, and is hence costoptimal 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.
[1] S. B. Akers, D. Harel, and B. Krishnamurthy, "The star graph: An attractive alternative to thencube,"Proc. Int. Conf. Parallel Process., 1987, pp. 393400.
[2] S. B. Akers and B. Krishnamurthy, "A grouptheoretic model for symmetric interconnection networks,"IEEE Trans. Comput., vol. 38, pp. 555566, 1989.
[3] Selim G. Akl,The Design and Analysis of Parallel Algorithms. Englewood Cliffs, NJ: PrenticeHall, 1989.
[4] S. G. Akl, J. Duprat, and A. G. Ferreira, "Building Hamiltonian circuits and paths in star graphs," Tech. Rep. 9022, Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon, France, Mar. 1990.
[5] W. T Cochran et al., "'What is the fast Fourier transform?,"IEEE Trans. Audio Electroacoust., vol. AU15, pp. 4555, June 1967.
[6] J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series,"Math. Comput., vol. 19, pp. 297301, 1965.
[7] P. Fragopoulou, "Parallel algorithms for the Fourier and other mathematical transforms," M.Sc. thesis, Dept. of Computing and Inform. Sci., Queen's University, Kingston, ON, Canada, Aug. 1990.
[8] A. Menn and A. K. Somani, "An efficient sorting algorithm for the star graph interconnection network,"Proc. Int. Conf. Parallel Process., vol. III, 1990, pp. 18.
[9] M. Nigam, S. Sahni, and B. Krishnamurthy, "Embedding Hamiltonians and hypercubes in star interconnection graphs,"Proc. Int. Conf. Parallel Process., vol. III, 1990, pp. 340343.
[10] D. S. Parker, "Notes on shuffle/exchangetype switching networks,"IEEE Trans. Comput., vol. C29, pp. 213223, 1980.
[11] M. C. Pease, "The indirect binaryncube microprocessor array,"IEEE Trans. Comput., vol. C26, pp. 458473, 1977.
[12] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[13] K. Qiu, H. Meijer, and S. Akl, "Decomposing a star graph into disjoint cycles,"Inform. Processing Lett., no. 39, pp. 125129, 1991.
[14] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C20, pp. 153161, 1971.
[15] C. D. Thompson, "Fourier transforms in VLSI,"IEEE Trans. Comput., vol. C32, pp. 10471057, 1983.
[16] E. H. Wold and A. Despain, "Pipeline and parallelpipeline FFT processors for VLSI implementations,"IEEE Trans. Comput., vol. C33, pp. 414426, 1984.
[17] C. N. Zhang, "Multidimensional systolic networks for discrete Fourier transform," inProc. 11th Annu. Int. Symp. Comput. Architecture, Ann Arbor, MI, 1984, pp. 2127.