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

Parallel Computing

Volumn 34, Issue 1, 2008, Pages 63-65

  Chedid, Fouad B ^a  

^a NOTRE DAME UNIVERSITY   (Lebanon)

Author keywords

Knapsack problem; Parallel algorithms; Two list algorithm

Indexed keywords

COMPUTATION THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SEARCH ENGINES;

KNAPSACK PROBLEM; TWO-LIST ALGORITHM;

PARALLEL ALGORITHMS;

EID: 38349152769     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2007.11.001     Document Type: Article

References (7)

1. Akl S.G. The Design and Analysis of Parallel Algorithms (1989), Prentice-Hall, Englewood Cliffs, NJ
2. Chang H.K.-C., Chen J.J.-R., and Shyu S.-J. A parallel algorithm for the knapsack problem using a generation and searching techniques. Parallel Computing 20 2 (1994) 233-243
3. Cosnard M., Ferreira A.G., and Herbelin H. The two-list algorithm for the Knapsack problem on a FPS T20. Parallel Computing 9 33 (1989) 385-388
4. Horowitz E., and Sahni S. Computing partitions with applications to the Knapsack problem. Journal of ACM 21 2 (1974) 277-292
5. Li K.-L., Li R.-F., and Li Q.-H. Optimal parallel algorithm for the knapsack problem without memory conflicts. Journal of Computer Science and Technology 19 6 (2004) 760-768
6. Lou D.-C., and Chang C.-C. A parallel two-list algorithm for the knapsack problem. Parallel Computing 22 (1997) 1985-1996
7. Sanches C.A.A., Soma N.Y., and Yanasse H.H. Comments on parallel algorithms for the knapsack problem. Parallel Computing 28 (2002) 1501-1505