On Routing Flexibility of Wormhole-Switched Priority-Preemptive NoCs.
Borislav NikolicLuís Miguel PinhoLeandro Soares IndrusiakPublished in: RTCSA (2016)
Keyphrases
- priority queue
- routing decisions
- mobile ad hoc networks
- lower bound
- switched networks
- routing protocol
- ad hoc networks
- shortest path
- routing problem
- routing algorithm
- data structure
- network topology
- scheduling algorithm
- scheduling problem
- processing times
- priority scheduling
- single machine
- response time
- wireless ad hoc networks
- traffic engineering
- intermediate nodes
- inter domain
- sensor networks
- qos routing
- optimal solution