Efficient linear systolic array for the knapsack problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

Efficient linear systolic array for the knapsack problem

Rumen Andonov
Patrice Quinton
  • Function : Author
  • PersonId : 833432


A processor-efficient systolic algorithm for the dynamic programming approach to the knapsack problem is presented in this paper. The algorithm is implemented on a linear systolic array where the number of cells q, the cell memory storage a and the input/output requirements are design parameters. These are independent of the problem size given by the number of the objects m and the knapsack capacity c. The time complexity of the algorithm is Q(mc/q+m) and both the time speedup and the processor efficiency are asymptotically optimal. A new procedure for the backtracking phase of the algorithm with a time complexity Q(m) is also proposed. It is an improvement on the usual strategies used for back-tracking which have a time complexity Q(m+c).


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1661.pdf (783.12 Ko) Télécharger le fichier

Dates and versions

inria-00074896 , version 1 (24-05-2006)


  • HAL Id : inria-00074896 , version 1


Rumen Andonov, Patrice Quinton. Efficient linear systolic array for the knapsack problem. [Research Report] RR-1661, INRIA. 1992. ⟨inria-00074896⟩
121 View
209 Download


Gmail Facebook X LinkedIn More