Efficient message routing in PrΣ-network

研究成果: Article同行評審

摘要

The PrΣ-network is a high performance interconnection network constructred by the recursive expansion method on the basis of the Petersen graph. As its cost (degree × diameter), a main performance measure for static interconnection networks, is very low in comparison with other known networks of the same size, PrΣ becomes an attractive configuration for high performance interconnection networks. This paper describes how message routing in a PrΣ network can be efficiently carried out. We first show a node addressing scheme for the network, and then present a simple and efficient routing algorithm for message routing in the network. Our algorithm realizes point-to-point message routing without the need of maintaining a routing table at each node, and has a time complexity of O(log nr) for a PrΣ-network containing nr = 10r + 1 nodes, where r ≥ 0.

原文English
頁(從 - 到)57-64
頁數8
期刊Microprocessing and Microprogramming
40
發行號1
DOIs
出版狀態Published - 1月 1994
對外發佈

指紋

深入研究「Efficient message routing in PrΣ-network」主題。共同形成了獨特的指紋。

引用此