In recent years, it has been witnessed that the systolic array is a successful architecture for
DNN hardware accelerators. However, the design of systolic arrays also encountered many …

This article surveys several methods that can be used to solve integer knapsack problems
on a variety of parallel computing architectures. Parallel algorithms designed for a variety of …

The parallelization on a supercomputer of a one list dynamic programming algorithm using
dominance technique and processor cooperation for the 0–1 knapsack problem is …

A systolic algorithm for the dynamic programming approach to the knapsack problem is
presented. The algorithm can run on any number of processors and has optimal time …

We present in this paper an efficient algorithm for solving the integral Knapsack problem on
hypercube. The main idea is to represent the computations of the dynamic programming …

The production of regular computations using algorithmic engineering techniques is
beginning to play an important role in the synthesis of massively parallel and VLSI processor …

We present a parallel solution to the unbounded knapsack problem on a linear systolic
array. It achieves optimal speedup for this well-known, NP-hard problem on a model of …

The authors first present a formal derivation and proof of correctness of a systolic array for
the knapsack problem, an NP-complete problem whose dependency graph is not …

The 0-1 knapsack problem is considered. A parallel dynamic programming multi-method
using dominance technique and processor cooperation is proposed. Different load …

A special class non uniform recurrent equations produced data dependency graphs which
involve non-constant data dependencies on the input data f (i) is considered. The …