Task-binding based branch-and-bound algorithm for NoC mapping.
Liyang ZhouMing-e JingLiulin ZhongZhiyi YuXiaoyang ZengPublished in: ISCAS (2012)
Keyphrases
- branch and bound algorithm
- lower bound
- upper bound
- branch and bound
- test problems
- np hard
- optimal solution
- lower bounding
- randomly generated problems
- precedence constraints
- combinatorial optimization
- mixed integer linear programming
- single machine scheduling problem
- upper bounding
- lagrangian relaxation
- routing algorithm
- variable ordering
- branch and bound method
- max sat
- objective function
- optimization problems
- multi processor
- search space
- network on chip