The proposed flit-admission and flit-ejection schemes are evaluated with both uniform and locality traffic in a 2D 4 x 4 mesh network. v flit sinks (v is the number of virtual channels per PC), the buffering cost of flit sinks becomes independent of v. In contrast to an ideal ejection model which requires p. For flit ejection, a p-sink model that uses only p flit sinks to eject flits is proposed. This scheme simplifies the switch crossbar from 2p x p to (p + 1) x p, where p is the number of PCs per switch. In particular, for flit admission, a novel coupling scheme which binds a flit-admission queue with a physical channel (PC) is presented. Different flit-admission and flit-ejection micro-architectures are investigated. Since flit admission, flit delivery and flit ejection interfere with each other directly and indirectly, techniques for admitting and ejecting flits exert a significant impact on network performance and switch cost.

When reaching destinations, flits are ejected from the network.

In wormhole-switched networks, packets are split into flits which are then admitted into and delivered in the network. Reducing the design complexity of switches is essential for cost reduction and power saving in on-chip networks. 546-556 Article in journal (Refereed) Published Abstract

2007 (English) In: Iet Computers and Digital Techniques, ISSN 1751-8601, Vol.

Iet computers & digital techniques