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 条

[41] Optimal attitude estimation algorithm based on mulitiple star-sensor observations
Ma, H. (mahongliang317@sina.com), 1600, Beijing University of Aeronautics and Astronautics (BUAA), 37 Xueyuan Rd., Haidian District, Beijing, 100083, China (39):
[42] An optimal algorithm for proper learning of unions of two rectangles with queries
Chen, ZX
COMPUTING AND COMBINATORICS, 1995, 959 : 334 - 343
[43] The Optimal Combination Decision Algorithm to Two Types of Venture Investment
Wang Zaixiang
Li Wangchen
Fan Junjie
INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS & STATISTICS, 2013, 41 (11): : 151 - 156
[44] A COUNTEREXAMPLE TO A CONJECTURE ON OPTIMAL LIST ORDERING
ANDERSON, EJ
NASH, P
WEBER, RR
JOURNAL OF APPLIED PROBABILITY, 1982, 19 (03) : 730 - 732
[45] Optimal Thresholds for Two-State ECG Compressing Algorithm
Luong Duong Trong
Linh Nguyen Tuan
Duc Nguyen Minh
Hoang Tran Duc
Ha Nguyen Thai
Thuan Nguyen Duc
2016 3RD INTERNATIONAL CONFERENCE ON BIOMEDICAL ENGINEERING (BME-HUST), 2016, : 3 - 7
[46] An efficient algorithm for the optimal market timing over two stocks
Li H.
An H.-Z.
Wu G.-F.
Acta Mathematicae Applicatae Sinica, 2004, 20 (3) : 411 - 424
[47] An optimal online algorithm for scheduling two machines with release times
Noga, J
Seiden, SS
THEORETICAL COMPUTER SCIENCE, 2001, 268 (01) : 133 - 143
[48] An Efficient Algorithm for the Optimal Market Timing over Two Stocks
Hui Li~1 Hong-zhi An~2 Guo-fu Wu~21 Department of Mathematics
Acta Mathematicae Applicatae Sinica, 2004, (03) : 57 - 70
[49] An optimal algorithm for two robots path planning problem on the grid
Davoodi, Mansoor
Abedin, Marjan
Banyassady, Bahareh
Khanteimouri, Payam
Mohades, Ali
ROBOTICS AND AUTONOMOUS SYSTEMS, 2013, 61 (12) : 1406 - 1414
[50] Near-optimal list colorings
Molloy, M
Reed, B
RANDOM STRUCTURES & ALGORITHMS, 2000, 17 (3-4) : 376 - 402

← 1 2 3 4 5 →