Dynamic, Energy-Aware Routing in NoC with Hardware Support †
The Network-on-Chip applications' performance and efficiency depend on task allocation and message routing, which are complex problems. The existing solutions assign priorities to messages in order to regulate their transmission. Unfortunately, this message classification can lead to routings t...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2025 |
| País: | España |
| Recursos: | Universitat Autònoma de Barcelona |
| Repositorio: | Dipòsit Digital de Documents de la UAB |
| Idioma: | inglés |
| OAI Identifier: | oai:ddd.uab.cat:318782 |
| Acesso em linha: | https://ddd.uab.cat/record/318782 https://dx.doi.org/urn:doi:10.3390/electronics14142860 |
| Access Level: | acceso abierto |
| Palavra-chave: | Dynamic NoC routing Hardware Hungarian algorithm Optimal message routing |
| Resumo: | The Network-on-Chip applications' performance and efficiency depend on task allocation and message routing, which are complex problems. The existing solutions assign priorities to messages in order to regulate their transmission. Unfortunately, this message classification can lead to routings that block the best global solution. In this work, we propose to use the Hungarian algorithm to dynamically route messages with the minimal cost, i.e., minimizing the communication times while consuming the least energy possible. To meet the real-time constraints coming from requiring results at each flit transmission, we also suggest a hardware version of it, which reduces the processing time by an average of 42.5% with respect to its software implementation. |
|---|