An improved simulated annealing heuristic for static partitioning of task graphs onto heterogeneous architectures.
Aravind VasudevanAvinash MalikDavid GreggPublished in: ICPADS (2014)
Keyphrases
- simulated annealing
- tabu search
- solution quality
- metaheuristic
- combinatorial optimization
- hill climbing
- evolutionary algorithm
- graph partitioning
- simulated annealing algorithm
- genetic algorithm
- genetic algorithm ga
- solution space
- job shop scheduling problem
- dynamic graph
- threshold accepting
- hybrid meta heuristic
- graph theory
- search procedure
- search algorithm
- optimization method
- spectral graph
- reversible jump mcmc
- graph theoretic
- stochastic search
- directed graph
- feasible solution
- neighborhood search
- heterogeneous environments
- graph matching
- global optimum
- series parallel
- vertex set
- graph representation
- random graphs
- graph clustering
- graph databases
- subgraph isomorphism
- tree search
- partitioning algorithm
- independent set
- minimum spanning tree
- graph mining
- graph model