An optimal and scalable parallelization of the two-list

13 years 4 months ago

Download mtc-m16.sid.inpe.br

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.

Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma,

Real-time Traffic

EOR 2007 | Item Subset-sum Problem | Memory Simd Architecture | Parallel Algorithm |

claim paper

» Global Optimizations for Parallelism and Locality on Scalable Parallel Machines

» Scalable HMM based inference engine in large vocabulary continuous speech recognition

» Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers

» Order or not does parallelization of model building in hBOA affect its scalability

» Scalable parallel algorithms for difficult combinatorial problems A case study in optimiza...

» Towards Scalable Grid Replica Optimization Framework

» Scalable Parallel BestFirst Search for Optimal Sequential Planning

» A scalable autotuning framework for compiler optimization

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	EOR
Authors	Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse

Comments (0)

Sciweavers

An optimal and scalable parallelization of the two-list

EOR 2007 | Item Subset-sum Problem | Memory Simd Architecture | Parallel Algorithm |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers