.png){kind=icon}
.png){kind=icon}
Return
Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.jpdc.2004.10.004.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2004 Elsevier Inc. All rights reserved.
Keywords:
parallel computing
load balancing
0-1 knapsack problem
dynamic programming
dominance technique
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available