Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0--1 knapsack problem

Authors:
D. El Baz;M. Elkihel
Affiliations:
LAAS-CNRS, 7, Avenue du Colonel Roche, 31077 Toulouse, Cedex 4, France;LAAS-CNRS, 7, Avenue du Colonel Roche, 31077 Toulouse, Cedex 4, France
Venue:
Journal of Parallel and Distributed Computing
Year:
2005

Citing 8
Cited 5

An introduction to parallelism in combinatorial optimization

Discrete Applied Mathematics
Dynamic load balancing for distributed memory multiprocessors

Journal of Parallel and Distributed Computing
A parallel algorithm for the knapsack problem using a generation and searching technique

Parallel Computing
Dynamic load balancing for parallelized particle simulations on MIMD computers

Parallel Computing
A parallel two-list algorithm for the knapsack problem

Parallel Computing
PLUM: parallel load balancing for adaptive unstructured meshes

Journal of Parallel and Distributed Computing
Computing Partitions with Applications to the Knapsack Problem

Journal of the ACM (JACM)
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Management Science

Solving knapsack problems on GPU

Computers and Operations Research
Shift-and-merge technique for the DP solution of the time-constrained backpacker problem

Computers and Operations Research
A dynamic programming method with lists for the knapsack sharing problem

Computers and Industrial Engineering
Novel binary biogeography-based optimization algorithm for the knapsack problem

ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I
Improving user QoS by relaxing resource reservation policy in high-performance grid environments

International Journal of Grid and Utility Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 presented. Such a technique generates irregular data structure, moreover the number of undominated states is unforeseeable. Original and efficient load balancing strategies are proposed. Finally, computational results obtained with an Origin 3800 supercomputer are displayed and analyzed. To the best of our knowledge, this is the first time for which computational experiments on a supercomputer are presented for a parallel dynamic programming algorithm using dominance technique.