Short communication: Observations on optimal parallelizations of two-list algorithm

Authors:
Carlos Alberto Alonso Sanches;Nei Yoshihiro Soma;Horacio Hideki Yanasse
Affiliations:
Instituto Tecnológico de Aeronáutica, CTA/ITA/IEC, Pça. Mal. Eduardo Gomes, 50, S.J. Campos, SP 12.228-900, Brazil;Instituto Tecnológico de Aeronáutica, CTA/ITA/IEC, Pça. Mal. Eduardo Gomes, 50, S.J. Campos, SP 12.228-900, Brazil;Instituto Nacional de Pesquisas Espaciais, INPE/LAC, Av. dos Astronautas, 1758, Jardim da Granja, S.J. Campos, SP 12227-010, Brazil
Venue:
Parallel Computing
Year:
2010

Citing 5
Cited 0

A parallel algorithm for the knapsack problem using a generation and searching technique

Parallel Computing
A parallel two-list algorithm for the knapsack problem

Parallel Computing
Computing Partitions with Applications to the Knapsack Problem

Journal of the ACM (JACM)
Comments on parallel algorithms for the knapsack problem

Parallel Computing
An optimal parallelization of the two-list algorithm of cost O(2n/2)

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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].