论文信息 - Order Preserving Communication on a Star Network

Order Preserving Communication on a Star Network

Abstract We present a scheme for ordering nodes in a star network such that it requires only a constant time for communication between a pair of nodes of the same rank in different sub-stars. This enables us to implement order preserving ASCEND/DESCEND type of divide and conquer algorithms such as the Fast Fourier Transform (FFT) efficiently on the star network. We also present a scheme to model a star network as a pipeline of sub-stars. This gives us a convenient framework for implementation of pipelined computations on a star network.

Dilip K. Saikia | Ranjan K. Sen

[1] Dilip Sarkar,et al. Optimal Broadcasting on the Star Graph , 1992, IEEE Trans. Parallel Distributed Syst..

[2] Ivan Stojmenovic,et al. Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry , 1993, Networks.

[3] Arun K. Somani,et al. An Efficient Sorting Algorithm for the Star Graph Interconnection Network , 1990, ICPP.

[4] Selim G. Akl,et al. A Novel Routing Scheme on the Star and Pancake Networks and its Applications , 1993, Parallel Comput..

[5] Sheldon B. Akers,et al. A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[6] S. Lakshmivarahan,et al. Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey , 1993, Parallel Comput..

[7] Franco P. Preparata,et al. The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).