스타 그래프에서의 무교착 라우팅 알고리듬

초록

Recently, a new interconnection network, called the star graph, was introduced in literature. This architecture offers a smaller diameter, a smaller average diameter, and a lover degree of node than the popular binary hypercube with similar number of nodes. Due to the availability of these desirable properties, the star graph is likely to become a useful interconnection network. In this paper, we present a deadlock-free routing algorithm using the hierarchial properties of the star graph and virual channels. We show that the proposed routing algorithm employs deadlock-free as well as less virtual channels than the other algorithm. As a result, it reduces the hardware cost drastically, as its dimension increases, even though it dows not route along the shortest paths.