Analytical models of bandwidth allocation in pipelined k-ary n-cubes

This paper extends existing work in virtual-channel flow control mechanisms by focusing on the bandwidth allocation issues. It presents an analytical model of the network that captures key phenomena of bandwidth allocation mechanisms in k-ary n-cubes. Tradeoffs are examined between full-duplex vs half-duplex links, purely demand-driven bandwidth allocation vs demand-driven allocation with CTS lookahead, and virtual to physical link assignment with link load balancing.<<ETX>>

[1]  William J. Dally.  Virtual-channel flow control , 1990, ISCA '90.

[2]  José Duato.  Deadlock-free adaptive routing algorithms for multicomputers: evaluation of a new algorithm , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[3]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[4]  Sudhakar Yalamanchili,et al.  Pipelined circuit-switching: a fault-tolerant variant of wormhole routing , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[5]  William J. Dally,et al.  Design of a Self-Timed VLSI Multicomputer Communication Controller, , 1987 .

[6]  Shekhar Y. Borkar,et al.  Supporting systolic and memory communication in iWarp , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.