Guaranteed bandwidth using looped containers in temporally disjoint networks within the nostrum network on chip
Authors:
Top Cited Papers
- 20 July 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (15301591) , 890-895
Abstract
In today's emerging network-on-chips, there is a need for different traffic classes with different quality-of-service guarantees. Within our NoC architecture nostrum, we have implemented a service of guaranteed bandwidth (GB), and latency, in addition to the already existing service of best-effort (BE) packet delivery. The guaranteed bandwidth is accessed via virtual circuits (VC). The VCs are implemented using a combination of two concepts that we call 'Looped Containers' and 'Temporally Disjoint Networks'. The looped containers are used to guarantee access to the network-independently of the current network load without dropping packets; and the TDNs are used in order to achieve several VCs, plus ordinary BE traffic, in the network. The TDNs are a consequence of the deflective routing policy used, and gives rise to an explicit time-division-multiplexing within the network. To prove our concept an HDL implementation has been synthesised and simulated. The cost in terms of additional hardware needed, as well as additional bandwidth is very low-less than 2 percent in both cases! Simulations showed that ordinary BE traffic is practically unaffected by the VCs.Keywords
This publication has 10 references indexed in Scilit:
- The Nostrum backbone-a communication protocol stack for Networks on Chip2004
- Networks on silicon: blessing or nightmare?2003
- A network on chip architecture and design methodology2003
- Networks on silicon: combining best-effort and guaranteed services2003
- Networks on chips: a new SoC paradigmComputer, 2002
- Route packets, net wires2001
- Addressing the system-on-a-chip interconnect woes through communication-based design2001
- A generic architecture for on-chip packet-switched interconnections2000
- Exact analysis of hot-potato routing1992
- Fat-trees: Universal networks for hardware-efficient supercomputingIEEE Transactions on Computers, 1985