Application of exhaustive search, branch and bound, parallel computing and Monte-Carlo methods for the synthesis of quasi-optimal network-on-chip topologies.
Aleksandr RomanovIrina RomanovaAlexander IvannikovPublished in: EWDTS (2017)
Keyphrases
- exhaustive search
- branch and bound
- parallel computing
- lower bound
- optimal solution
- search space
- monte carlo methods
- search algorithm
- branch and bound algorithm
- dynamic programming
- upper bound
- solution space
- search methods
- parallel computers
- computational complexity
- combinatorial optimization
- simulated annealing
- shared memory
- monte carlo
- genetic algorithm
- parallel machines
- massively parallel
- parallel computation
- computing systems
- cost function