Skip to Main content Skip to Navigation
Journal articles

Scalable shared-memory architecture to solve the Knapsack 0/1 problem

Abstract : Dynamic Programming (DP) is used to solve combinatorial optimization problems and constitutes one of the 13 High Performance Computing (HPC) patterns. DP suffers from irregular, data-dependent memory accesses that deteriorates performance. The Knapsack 0/1 belongs to the simplest DP algorithms which is called Serial Monadic and has been treated in software with cache-efficient algorithms as well as parallel threads, OpenMP or MPI.
Document type :
Journal articles
Complete list of metadata
Contributor : Anthony Kolar Connect in order to contact the contributor
Submitted on : Friday, March 23, 2018 - 3:18:53 PM
Last modification on : Tuesday, November 16, 2021 - 5:12:37 AM



Fernando Escobar, Anthony Kolar, Naim Harb, Filipe Vinci dos Santos, Carlos Valderrama. Scalable shared-memory architecture to solve the Knapsack 0/1 problem. Microprocessors and Microsystems: Embedded Hardware Design (MICPRO), Elsevier, 2017, 50, pp.189 - 201. ⟨10.1016/j.micpro.2017.04.001⟩. ⟨hal-01691980⟩



Record views