A Scalable NoC Router Design Providing QoS Support Using Weighted Round Robin Scheduling

Networks on Chip are the most promising approach to cope with communication requirements in future many core SoCs. Depending on the executed applications, communication requirements may vary at run-time. Dynamic reservation of communication resources in virtual channel NoCs is an encouraging approac...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications s. 625 - 632
Hlavní autoři: Heißwolf, J., Konig, R., Becker, J.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.07.2012
Témata:
Bandwidth
Best Effort
Guaranteed Service
Networks-on-Chip
QoS
Quality of service
Round robin
Router Design
Routing
Scalability
Scalable
Throughput
Time division multiplexing
Weighted Round Robin Scheduling
ISBN:1467316318, 9781467316316
ISSN:2158-9178
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Networks on Chip are the most promising approach to cope with communication requirements in future many core SoCs. Depending on the executed applications, communication requirements may vary at run-time. Dynamic reservation of communication resources in virtual channel NoCs is an encouraging approach for connection-oriented communication guaranteeing QoS. This paper presents a concept enhancing virtual channel reservation to support different bandwidth and latency guarantees. The used weighted round robin scheduling provides hard guarantees regarding throughput and latency. The proposed router design enables dynamic sharing of communication resources between connectionless Best Effort and connection-oriented Guaranteed Service traffic. Due to decentralized routing and resource management it offers a very good scalability for future many core architectures. Simulation results are obtained from a 10x10 NoC with a cycle accurate SystemC router model. The presented results are compared to existing round robin arbitration schemes and show the advantage of the proposed concept. Synthesis results expose its low area overhead.
ISBN:1467316318
9781467316316
ISSN:2158-9178
DOI:10.1109/ISPA.2012.93