Title :
Embedding torus on the star graph
Author :
Saikia, Dilip K. ; Badrinath, R. ; Sen, Ranjan K.
Author_Institution :
Dept. of Comput. Sci., Tezpur Univ., India
fDate :
7/1/1998 12:00:00 AM
Abstract :
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 (≈2) with an increase in expansion cost. For a second routing scheme, the congestion is O(n), for an n-star, with bounded expansion
Keywords :
graph theory; multiprocessor interconnection networks; congestion; routing scheme; star graph; torus embedding; Buildings; Computational modeling; Computer networks; Concurrent computing; Costs; Hypercubes; Multiprocessor interconnection networks; Parallel processing; Peer to peer computing; Routing;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
