Distributed Processing and The Design of Parallel Routing Algorithm on an Recursive Circulant Network


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 11, pp. 2701-2710, Nov. 1997
10.3745/KIPSTE.1997.4.11.2701,   PDF Download:

Abstract

Recursive circulant graph has recently developed as a new model of multiprocessors, and drawn considerable attention to supercomputing. In this paper, we investigate the routing of a message in recursive circulant, that is a key to the performance of this network. On recursive circulant network, we would like to transmit m packets from a source node to a destination node simultaneously along paths, where the ith packet will traverse along the ith path(0%u2264i%u2264m-1). In oder for all packets to arrive at the destination node quickly and securely, the ith path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS), a special class of (n?n) matrices, we present O(n^2) parallel routing algorithm on recursive circulant 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]
B. Y. Keun, P. B. Kwon, C. I. Yong, "Distributed Processing and The Design of Parallel Routing Algorithm on an Recursive Circulant Network," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 11, pp. 2701-2710, 1997. DOI: 10.3745/KIPSTE.1997.4.11.2701.

[ACM Style]
Bae Yong Keun, Park Byung Kwon, and Chung Il Yong. 1997. Distributed Processing and The Design of Parallel Routing Algorithm on an Recursive Circulant Network. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 11, (1997), 2701-2710. DOI: 10.3745/KIPSTE.1997.4.11.2701.