|
马上注册,结交更多好友,享用更多功能,让你轻松玩转社区。
您需要 登录 才可以下载或查看,没有账号?注册
x
本帖最后由 cybstef 于 2011-5-25 13:26 编辑
abstract
Evolving technology and increasing pin-bandwidth moti-
vate the use of high-radix routers to reduce the diameter, la-
tency, and cost of interconnection networks. High-radix net-
works, however, require longer cables than their low-radix
counterparts. Because cables dominate network cost, the num-
ber of cables, and particularly the number of long, global ca-
bles should be minimized to realize an efficient network. In
this paper, we introduce the dragonfly topology which uses a
group of high-radix routers as a virtual router to increase the
effective radix of the network. With this organization, each
minimally routed packet traverses at most one global channel.
By reducing global channels, a dragonfly reduces cost by 20%
compared to a flattened butterfly and by 52% compared to a
folded Clos network in configurations with ≥ 16K nodes.
We also introduce two new variants of global adaptive rout-
ing that enable load-balanced routing in the dragonfly. Each
router in a dragonfly must make an adaptive routing decision
based on the state of a global channel connected to a different
router. Because of the indirect nature of this routing decision,
conventional adaptive routing algorithms give degraded per-
formance. We introduce the use of selective virtual-channel
discrimination and the use of credit round-trip latency to both
sense and signal channel congestion. The combination of these
two methods gives throughput and latency that approaches
that of an ideal adaptive routing algorithm. |
|