An efficient parallel algorithm for solving the Knapsack problem on hypercubes

被引：10
|
作者：
Goldman, A [1 ]
Trystram, D [1 ]
机构：
[1] IMAG, ID, F-38330 Montbonnot St Martin, France
来源：
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 2004年 / 64卷 / 11期
关键词：
hypercube; Knapsack problem; irregular mesh; scheduling;
D O I：
10.1016/j.jpdc.2002.10.001
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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 formulation as a precedence graph (which has the structure of an irregular mesh). Then, we propose a time optimal scheduling algorithm for computing the irregular meshes on hypercube. (C) 2004 Elsevier Inc. All rights reserved.
引用
下载
收藏
页码：1213 / 1222
页数：10
相关论文
共 50 条
  • [41] Work and memory-efficient parallel algorithms for the knapsack problem
    Ferreira, A
    INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING, 1995, 7 (04): : 595 - 606
  • [42] The Parallel Processing Approach to the Dynamic Programming Algorithm of Knapsack Problem
    Sin, Si Thu Thant
    PROCEEDINGS OF THE 2021 IEEE CONFERENCE OF RUSSIAN YOUNG RESEARCHERS IN ELECTRICAL AND ELECTRONIC ENGINEERING (ELCONRUS), 2021, : 2252 - 2256
  • [43] Optimal parallel algorithm for the knapsack problem without memory conflicts
    Li, KL
    Li, QH
    Wang-Hui
    Jiang, SY
    PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PDCAT'2003, PROCEEDINGS, 2003, : 518 - 521
  • [44] AN IMPROVED PARALLEL ALGORITHM FOR 0/1 KNAPSACK-PROBLEM
    CHEN, GH
    JANG, JH
    PARALLEL COMPUTING, 1992, 18 (07) : 811 - 821
  • [45] A PARALLEL ALGORITHM FOR THE 0-1 KNAPSACK-PROBLEM
    LOOTS, W
    SMITH, THC
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1992, 21 (05) : 349 - 362
  • [46] Optimal parallel algorithm for the knapsack problem without memory conflicts
    Li, KL
    Li, RF
    Li, QH
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2004, 19 (06) : 760 - 768
  • [47] Efficient parallel multiselection on hypercubes
    Shen, H
    THIRD INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS, PROCEEDINGS (I-SPAN '97), 1997, : 338 - 343
  • [48] Efficient parallel algorithm for dense matrix LU decomposition with pivoting on hypercubes
    Liu, Zhiyong
    Cheung, D.W.
    Computers and Mathematics with Applications, 1997, 33 (08): : 39 - 50
  • [49] Improved simulated annealing algorithm solving for 0/1 knapsack problem
    Liu, Aizhen
    Wang, Jiazhen
    Han, Guodong
    Wang, Suzhen
    Wen, Jiafu
    ISDA 2006: SIXTH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, VOL 2, 2006, : 1159 - +
  • [50] A surface-based DNA algorithm for the solving binary knapsack problem
    Darehmiraki, Majid
    Nehi, Hasan Mishmast
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 188 (02) : 1991 - 1994
12345