Several unicast routing protocols have been presented for unicast traffic in MPSoCs. Exploiting the unicast routingalgorithms for multicast traffic increases the likelihood of deadlock and congestion. In order to avo...
详细信息
Several unicast routing protocols have been presented for unicast traffic in MPSoCs. Exploiting the unicast routingalgorithms for multicast traffic increases the likelihood of deadlock and congestion. In order to avoid deadlock for multicast traffic, the hamiltonianpath strategy was introduced. The traditional hamiltonianpathrouting protocols supporting both unicast and multicast traffic are based on deterministic models, leading to lower performance. In this paper, we propose an adaptive routing protocol for both unicast and multicast traffic without using virtual channels. The proposed method maximizes the degree of adaptiveness of the routing functions which are based on the hamiltonianpath while guaranteeing deadlock freedom. Furthermore, both unicast and multicast aspects of the presented method have been widely investigated separately. Results obtained in both synthetic and real traffic models show that the proposed adaptive method for multicast and unicast aspects has lower latency and power dissipation compared to previously proposed path-based multicasting algorithms with negligible hardware overhead. (C) 2010 Elsevier B.V. All rights reserved.
暂无评论