Scalable shared-memory architecture to solve the Knapsack 0/1 problem.
Fernando A. EscobarAnthony KolarNaim HarbFilipe Vinci dos SantosCarlos ValderramaPublished in: Microprocess. Microsystems (2017)
Keyphrases
- knapsack problem
- shared memory
- multi processor
- randomly generated test instances
- parallel architecture
- message passing
- continuous relaxation
- parallel algorithm
- optimization problems
- distributed memory
- parallel computing
- optimal solution
- dynamic programming
- program execution
- commodity hardware
- parallel computers
- memory access
- exact algorithms
- graphic processing unit
- single processor
- heterogeneous platforms
- multidimensional knapsack problem
- parallel machines
- np hard
- greedy algorithm
- multi core systems
- special case
- multithreading
- shared memory multiprocessors
- objective function
- multi core processors
- parallel programming
- search algorithm
- tabu search
- implicit enumeration
- parallel architectures
- bayesian networks
- maximum profit
- distributed systems
- cloud computing
- metaheuristic