Publication
Optimal Minimal Routing and Priority Assignment for Priority-Preemptive Real-Time NoCs
| dc.contributor.author | Nikolic, Borislav | |
| dc.contributor.author | Pinho, Luís Miguel | |
| dc.date.accessioned | 2017-05-18T10:49:33Z | |
| dc.date.embargo | 2117 | |
| dc.date.issued | 2017 | |
| dc.description.abstract | The Network-on-Chip (NoC) architecture is an interconnect network with a good performance and scalability potential. Thus, it comes as no surprise that NoCs are among the most popular interconnect mediums in nowadays available many-core platforms. Over the years, the real-time community has been attempting to make NoCs amenable to the real-time analysis. One such approach advocates to employ virtual channels. Virtual channels are hardware resources that can be used as an infrastructure to facilitate flit-level preemptions between communication traffic flows. This gives the possibility to implement priority-preemptive arbitration policies in routers, which is a promising step towards deriving real-time guarantees for NoC traffic. So far, various aspects of priority-preemptive NoCs were studied, such as arbitration, priority assignment, routing, and workload mapping. Due to a potentially large solution space, the majority of available techniques are heuristic-centric, that is, either pure heuristics, or heuristic-based search strategies are used. Such approaches may lead to an inefficient use of hardware resources, and may cause a resource over-provisioning as well as unnecessarily high design-cost expenses. Motivated by this reality, we take a different approach, and propose an integer linear program to solve the problems of priority assignment and routing of NoC traffic. The proposed method finds optimal routes and priorities, but also allows to reduce the search space (and the computation time) by fixing either priorities or routes, and derive optimal values for remaining parameters. This framework is used to experimentally evaluate both the scalability of the proposed method, as well as the efficiency of existing priority assignment and routing techniques. | pt_PT |
| dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
| dc.identifier.doi | 10.1007/s11241-017-9273-8 | pt_PT |
| dc.identifier.issn | 1573-1383 | |
| dc.identifier.uri | http://hdl.handle.net/10400.22/9836 | |
| dc.language.iso | eng | pt_PT |
| dc.peerreviewed | yes | pt_PT |
| dc.publisher | Springer | pt_PT |
| dc.relation | Parallel SOftware framework for time-CRitical mAny-core sysTEmS | |
| dc.relation.ispartofseries | Real-Time Systems; | |
| dc.relation.publisherversion | https://link.springer.com/article/10.1007/s11241-017-9273-8 | pt_PT |
| dc.subject | Real-time systems | pt_PT |
| dc.subject | Embedded systems | pt_PT |
| dc.subject | Network-on-Chip | pt_PT |
| dc.subject | Wormhole switching | pt_PT |
| dc.subject | Virtual channels | pt_PT |
| dc.subject | Priority-preemptive arbitration | pt_PT |
| dc.title | Optimal Minimal Routing and Priority Assignment for Priority-Preemptive Real-Time NoCs | pt_PT |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.awardTitle | Parallel SOftware framework for time-CRitical mAny-core sysTEmS | |
| oaire.awardURI | info:eu-repo/grantAgreement/EC/FP7/611016/EU | |
| oaire.citation.endPage | 35 | pt_PT |
| oaire.citation.startPage | 1 | pt_PT |
| oaire.citation.title | Real-Time Systems | pt_PT |
| oaire.fundingStream | FP7 | |
| person.familyName | Pinho | |
| person.givenName | Luis Miguel | |
| person.identifier.ciencia-id | 8112-2108-F3B2 | |
| person.identifier.orcid | 0000-0001-6888-1340 | |
| person.identifier.rid | M-3416-2013 | |
| person.identifier.scopus-author-id | 6602594556 | |
| project.funder.identifier | http://doi.org/10.13039/501100008530 | |
| project.funder.name | European Commission | |
| rcaap.rights | restrictedAccess | pt_PT |
| rcaap.type | article | pt_PT |
| relation.isAuthorOfPublication | fd791145-af93-47d9-bbe8-647a326d2f39 | |
| relation.isAuthorOfPublication.latestForDiscovery | fd791145-af93-47d9-bbe8-647a326d2f39 | |
| relation.isProjectOfPublication | 88e3c263-adf4-4fb5-bb99-418ffe5993ed | |
| relation.isProjectOfPublication.latestForDiscovery | 88e3c263-adf4-4fb5-bb99-418ffe5993ed |