An optimal and scalable parallelization of the two-list

In this paper, we suggest a parallel algorithm based on a shared memory SIMD architecture for solving an n item subset-sum problem in time O(2n/2 /p) by using p = 2q processors, 0 6 q 6 n 2 À 2log2n. This approach is an optimal and scalable parallelization of the well known two-list Horowitz and SahniÕs algorithm, which is still the best complexity time bound for solving the Knapsack problem in a serial environment. Ó 2005 Elsevier B.V. All rights reserved.

• Type: Journal
• Year: 2007
• Where: EOR
• Authors: Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse
• Keywords: EOR 2007, Item Subset-sum Problem, Memory Simd Architecture, Parallel Algorithm