A fast and energy efficient branch and bound algorithm for NoC task mapping.
Jiashen LiYun PanPublished in: ICCD (2015)
Keyphrases
- energy efficient
- branch and bound algorithm
- routing algorithm
- wireless sensor networks
- lower bound
- branch and bound
- energy consumption
- optimal solution
- upper bound
- sensor networks
- np hard
- combinatorial optimization
- lower bounding
- randomly generated problems
- base station
- routing protocol
- precedence constraints
- multi hop
- data dissemination
- single machine scheduling problem
- upper bounding
- energy efficiency
- search algorithm
- finding an optimal solution
- multi core architecture
- objective function
- ad hoc networks
- sensor nodes
- data transmission
- end to end
- response time
- data sets