Look-ahead adaptive routing on k-ary n-trees

Authors:
Quanbao Sun;Liquan Xiao;Minxuan Zhang
Affiliations:
PDL, School of Computer, National University of Defense Technology, China;PDL, School of Computer, National University of Defense Technology, China;PDL, School of Computer, National University of Defense Technology, China
Venue:
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Year:
2007

Citing 7
Cited 0

Deadlock-free multicast wormhole routing in multicomputer networks

ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
The Quadrics Network: High-Performance Clustering Technology

IEEE Micro
Tree-Based Multicasting on Wormhole Routed Multistage Interconnection Networks

ICPP '97 Proceedings of the international Conference on Parallel Processing
k -ary n -trees: High Performance Networks for Massively Parallel Architectures

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Optimizing communication for massively parallel processing

Optimizing communication for massively parallel processing
Hardware-Based Multicast with Global Load Balance on k-ary n-trees

ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing
Multicast scheduling for input-queued switches

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Supporting multicast at hardware level is a future trend of interconnection networks, and the latency of hardware-based multicast is sensitive to network conflict. In this paper, we study the method to forecast and reduce the conflict between unicast and multicast traffic on k-ary n-trees. We first derive a switch grouping method to describe the relationship among switches being passed through by a unicast routing path or a multicast tree. Then we analyze the sufficient condition for conflict-free routing. Based on these observations, a look-ahead adaptive routing strategy for unicast packet is proposed. The simulation results indicate that the proposed strategy can lower the multicast latency and the unicast latency simultaneously.