Lagrangian relaxation-based routing path allocation for application-specific network-on-chips.
Jinglei HuangWei ZhongZhigang LiSong ChenPublished in: Integr. (2018)
Keyphrases
- application specific
- lagrangian relaxation
- shortest path
- high bandwidth
- path selection
- general purpose
- multiple paths
- network design problem
- integer programming
- link failure
- feasible solution
- routing algorithm
- branch and bound algorithm
- column generation
- routing table
- peer to peer
- switched networks
- high density
- lower bound
- lagrangian heuristic
- resource allocation
- wireless sensor networks
- np hard
- minimum cost
- file system
- road network
- network structure
- linear programming
- lower and upper bounds
- particle swarm optimization
- dual decomposition
- computation intensive
- search space