|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Dilip K. Saikia, Ranjan K. Sen, "Two Ranking Schemes for Efficient Computation on the Star Interconnection Network," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 4, pp. 321-327, April, 1996. | |||
| BibTex | x | ||
| @article{ 10.1109/71.494627, author = {Dilip K. Saikia and Ranjan K. Sen}, title = {Two Ranking Schemes for Efficient Computation on the Star Interconnection Network}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {4}, issn = {1045-9219}, year = {1996}, pages = {321-327}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.494627}, 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 - Two Ranking Schemes for Efficient Computation on the Star Interconnection Network IS - 4 SN - 1045-9219 SP321 EP327 EPD - 321-327 A1 - Dilip K. Saikia, A1 - Ranjan K. Sen, PY - 1996 KW - Star interconnection network KW - parallel processing KW - ASCEND/DESCEND algorithm KW - pipelined algorithm KW - node ranking KW - order preserving communication KW - Fast Fourier Transform (FFT) KW - matrix multiplication. VL - 7 JA - IEEE Transactions on Parallel and Distributed Systems ER - | |||
Abstract—A node ranking scheme provides the necessary structural view for developing algorithms on a network. We present two ranking schemes for the star interconnection network both of which allow constant time order preserving communication. The first scheme is based on a hierarchical view of the star network. It enables one to efficiently implement order preserving ASCEND/DESCEND class of algorithms. This class includes several important algorithms such as the Fast Fourier Transform (FFT) and matrix multiplication. The other ranking scheme gives a flexible pipelined view of the star interconnection network and provides a suitable framework for implementation of pipelined algorithms.
[1] S.B. Akers, D. Harel, and B. Krishnamurthy, "The Star Graph: An Attractive Alternative to the n-Cube," Proc. Int'l Conf. Parallel Processing, pp. 393-400, 1987.
[2] S.B. Akers and B. Krishnamurthy, “A Group-Theoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
[3] S.G. Akl and K. Qiu, "A Novel Routing Scheme on the Star and Pancake Networks and its Applications," Parallel Computing, vol. 19, pp. 96-101, 1993.
[4] S.G. Akl, K. Qiu, and I. Stojmenovic, "Fundamental Algorithms for the Star and Pancake Interconnection Networks with Applications to Computational Geometry," NETWORKS, vol. 23, pp. 215-225, 1993.
[5] P. Fragopoulou and S.G. Akl, "A Parallel Algorithm for Computing Fourier Transforms on the Star Graph," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 5, pp. 525-531, May 1994.
[6] J. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Embedding of Cycles and Grids in Star Graphs," J. Circuits, Systems, and Computers, vol. 1, no. 1, pp. 43-74, 1991.
[7] V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin Cummings, 1994.
[8] S. Lakshmivarahan, J. Jwo, and S.K. Dhall, "Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey," Parallel Computing, vol. 19, pp. 361-407, 1993.
[9] A. Menn and A.K. Somani, "An Efficient Sorting Algorithm for the Star Graph Interconnection Network," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 1-8,St. Charles, Ill., 1990.
[10] F.P. Preparata and J. Vuillemin, “The Cube-Connected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300-309, 1981.