The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—In this paper, we present a scheme for efficient embedding of torus of any dimension on a star graph. The dilation of the embedding is four. The expansion is small. Congestion depends upon the routing scheme used. With one routing scheme, the congestion is bound by a small constant <tmath>$(\approx 2)$</tmath> with an increase in expansion cost. For a second routing scheme, the congestion is <it>O</it>(<it>n</it>), for an n-star, with bounded expansion.</p>
Graph embedding, star graph, torus embedding, cycle construction, interconnection network, parallel processing.
Ranjan K. Sen, Dilip K. Saikia, R. Badrinath, "Embedding Torus on the Star Graph", IEEE Transactions on Parallel & Distributed Systems, vol. 9, no. , pp. 650-663, July 1998, doi:10.1109/71.707542
87 ms
(Ver 3.3 (11022016))