Observations on optimal parallelizations of two-list algorithm

被引：2
|
作者：
Alonso Sanches, Carlos Alberto [1 ]
Soma, Nei Yoshihiro [1 ]
Yanasse, Horacio Hideki [2 ]
机构：
[1] CTA ITA IEC, Inst Tecnol Aeronaut, BR-12228900 Sao Jose Dos Campos, SP, Brazil
[2] INPE LAC, Inst Nacl Pesquisas Espaciais, BR-12227010 Sao Jose Dos Campos, SP, Brazil
来源：
PARALLEL COMPUTING | 2010年 / 36卷 / 01期
基金：
巴西圣保罗研究基金会;
关键词：
Knapsack problem; Subset-sum problem; Parallel algorithm; Two-list algorithm;
D O I：
10.1016/j.parco.2009.09.005
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
For more than three decades, the very well known and famous two-list Horowitz and Sahni algorithm [3] remains the serial upper-bound for the 0-1 Knapsack problem with n items (KP01) in a time bounded by O(2(n/2)). Recently, Chedid [2] Suggested an optimal parallelization for that algorithm to a KP01 variation - the subset-sum problem - in a PRAM CREW with p = 2(n/8) processors. It is presented here that, in addition to be incomplete, the Chedid result is a particular case given by Sanches et al. [6]. (c) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码：65 / 67
页数：3
相关论文
共 50 条
12345