Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem - Archive ouverte HAL Access content directly
Journal Articles Journal of Parallel and Distributed Computing Year : 2005

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

(1) , (1)
1
Didier El Baz
Moussa Elkihel
  • Function : Author
  • PersonId : 840524

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 structures, moreover the number of dominated 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 results on a supercomputer are presented for a parallel dynamic programming algorithm using dominance technique.
Fichier principal
Vignette du fichier
jpdc04.pdf (202.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01153786 , version 1 (20-05-2015)

Identifiers

  • HAL Id : hal-01153786 , version 1

Cite

Didier El Baz, Moussa Elkihel. Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem. Journal of Parallel and Distributed Computing, 2005, 65 (5), pp. 74-84. ⟨hal-01153786⟩
101 View
126 Download

Share

Gmail Facebook Twitter LinkedIn More