An Efficient Parallel Algorithm for Solving the Knapsack Problem on the Hypercube

Authors:
A. Goldman;Denis Trystram
Affiliations:
-;-
Venue:
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Year:
1997

Citing 8
Cited 1

A hypercube algorithm for the 0/1 knapsack problem

Journal of Parallel and Distributed Computing
Adaptive parallel algorithms for integral knapsack problems

Journal of Parallel and Distributed Computing - Special issue: algorithms for hypercube computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
New complexity results on scheduling with small communication delays

Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
Some models for scheduling parallel programs with communication delays

Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Optimal schedules for d-D grid graphs with communication delays

Parallel Computing
Computing Partitions with Applications to the Knapsack Problem

Journal of the ACM (JACM)
A Parallel Algorithm for the Knapsack Problem

IEEE Transactions on Computers

An efficient parallel algorithm for solving the Knapsack problem on hypercubes

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a new algorithm to solve the integral knapsack problem on the hypercube. The main idea is to use the fact that the precedence graph of the dynamic programming function of the knapsack problem is an irregular mesh. We propose a scheduling algorithm for irregular meshes on the hypercube. The efficiency of the algorithm is independent on the number of processors. We also present some improvements for the solution of the 0/1 knapsack problem on the hypercube.