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

Authors:
Fouad B. Chedid
Affiliations:
Department of Computer Science, Notre Dame University - Louaize, P.O. Box 72, Zouk Mikael, Zouk Mosbeh, Lebanon
Venue:
Parallel Computing
Year:
2008

Citing 6
Cited 4

The design and analysis of parallel algorithms

The design and analysis of parallel algorithms
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
Optimal parallel algorithm for the knapsack problem without memory conflicts

Journal of Computer Science and Technology

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

Parallel Computing
Parallel solution of the subset-sum problem: an empirical study

Concurrency and Computation: Practice & Experience
A note on developing optimal and scalable parallel two-list algorithms

ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
A Novel CPU-GPU Cooperative Implementation of A Parallel Two-List Algorithm for the Subset-Sum Problem

Proceedings of Programming Models and Applications on Multicores and Manycores

Quantified Score

Hi-index	0.01

Visualization

Abstract

In 1994, Chang et al. [Parallel Computing 20 (1994)] claimed a parallelization of the two-list algorithm of cost O(2^5^n^/^8) based on a shared memory CREW SIMD PRAM model of computation. In 1997, Lou and Chang [Parallel Computing 22 (1997)] proposed a novel search phase for the two-list algorithm which when combined with Chang et al.'s generation phase gives an optimal parallelization of the two-list algorithm. In 2002, Sanches et al. [Parallel Computing 28 (2002)] proved that the results about Chang et al.'s generation phase are incorrect invalidating both Chang et al's and Lou and Chang's results. In this paper, we describe a new generation phase for the two-list algorithm which when combined with the search phase of Lou and Chang reclaims an optimal parallelization of the two-list algorithm of cost O(2^n^/^2).