Application of the Special Matrices to the Parallel Routing Algorithm on MRNS Network


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 1, pp. 55-62, Jan. 1996
10.3745/KIPSTE.1996.3.1.55,   PDF Download:

Abstract

MRNS network is a general algebraic structure of Hypercube network, which has recently drawn considerable attention to supercomputing and message-passing communications. In this paper, we investigate the routing of a message in an n-dimensional MRNS network, that is a key to the performance of this network. On the n-dimensional MRNS network we would like to transmit packets from a source node to a destination node simultaneously along a fixed number of paths, where the superscript packet will traverse along the superscript path. In order for all packets to arrive at the destination node quickly and securely, the ith path must be node-disjoint from all other paths. By investigating the conditions of node-disjoint paths, we will employ the special matrices called as the Hamiltonian Circuit Latin Square(HCLS) described in [1] to construct a set of node-disjoint paths and suggest a linear-time parallel routing algorithm for the MRNS network.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
C. W. Kyoo and C. I. Yong, "Application of the Special Matrices to the Parallel Routing Algorithm on MRNS Network," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 3, no. 1, pp. 55-62, 1996. DOI: 10.3745/KIPSTE.1996.3.1.55.

[ACM Style]
Choi Wan Kyoo and Chung Il Yong. 1996. Application of the Special Matrices to the Parallel Routing Algorithm on MRNS Network. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 3, 1, (1996), 55-62. DOI: 10.3745/KIPSTE.1996.3.1.55.