A greedy approach for latency-bounded deadlock-free routing path allocation for application-specific NoCs.
Amit VermaPritpal S. MultaniDaniel Mueller-GritschnederVladimir TodorovUlf SchlichtmannPublished in: NOCS (2013)
Keyphrases
- application specific
- deadlock free
- routing algorithm
- shortest path
- general purpose
- ad hoc networks
- wireless sensor networks
- routing protocol
- concurrency control
- resource allocation
- network traffic
- response time
- file system
- network resources
- instruction set
- transaction processing
- computation intensive
- energy consumption
- database
- nearest neighbor
- management system
- database systems
- low latency
- databases