Scalable shared-memory architecture to solve the Knapsack 0/1 problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Microprocessors and Microsystems: Embedded Hardware Design Année : 2017

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-01691980 , version 1 (23-03-2018)

Identifiants

Citer

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 , 2017, 50, pp.189 - 201. ⟨10.1016/j.micpro.2017.04.001⟩. ⟨hal-01691980⟩
156 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More