Optimal parallel algorithm for the knapsack problem without memory conflicts

Journal of Computer Science and Technology

Volumn 19, Issue 6, 2004, Pages 760-768

  Li, Ken Li ^a,b   Li, Ren Fa ^a   Li, Qing Hua ^b  

^a HUNAN UNIVERSITY   (China)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Knapsack problem; Memory conflict; NP complete; Optimal algorithm; Parallel algorithm

Indexed keywords

COMPUTER SCIENCE; DATA STORAGE EQUIPMENT; INTEGER PROGRAMMING; MATHEMATICAL MODELS; NUMBER THEORY; PARALLEL ALGORITHMS; PROBLEM SOLVING; PROGRAM PROCESSORS;

KNAPSACK PROBLEM; MEMORY CONFLICT; NP-COMPLETE; OPTIMAL ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 12744278278     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02973436     Document Type: Article

References (17)

1. Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, W H Freeman and Co., 1979.
2. Shamir A. A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem. IEEE Trans. Inform. Theory, 1984, 30(5): 699-704.
3. Chor B, Rivest R L. A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inform. Theory, 1988, 34(5): 901-909.
4. Laih C S, Lee J Y, Harn L, Su Y K. Linearly shift knapsack public-key cryptosystem. IEEE J. Selected Areas Commun., 1989, 7(4): 534-539.
5. Horowitz E, Sahni S. Computing partitions with applications to the knapsack problem. J. ACM, 1974, 21(2): 277-292.
6. Aardal K, Bixby R E, Hurkens C A J, Lenstra A. K et al. Market split and basis reduction: Towards a solution of the Cornuejils-Dawande instances. In The 7th International IPCO Conference, 1999, Lecture Notes in Computer Science 1610, pp.1-16.
7. n/4) algorithm for certain NP-complete problems. SIAM J. Comput., 1981, 10(3): 456-464.
8. n/2) for the knapsack problem. IEEE Trans. Comput., 1991, 40(2): 221-225.
9. Karnin E D. A parallel algorithm for the knapsack problem. IEEE Trans. Comput., 1984, 33(5): 404-408.
10. Amirazizi H R, Hellman M E. Time-memory -processor tradeoffs. IEEE Trans. Inform. Theory, 1988, 34(3): 502-512.
11. Ferreira A G. Work and memory efficient parallel algorithms for the knapsack problem. International Journal of High Speed Computing, 1995, 4: 595-606.
12. Chang H K C, Chen J J R, Shyu S J. A parallel algorithm for the knapsack problem using a generation and searching technique. Parallel Computing, 1994, 20(2): 233-243.
13. Lou D C, Chang C C. A parallel two-list algorithm for the knapsack problem. Parallel Computing, 1997, 22: 1985-1996.
14. Aanches C A A, Soma N Y, Yanasse H H. Comments on parallel algorithms for the knapsack problem. Parallel Computing, 2002, 28: 1501-1505.
15. Ferreira A G, Robson J M. Fast and scalable parallel algorithms for knapsack-like problems. Journal of Parallel and Distributed Computing, 1996, 39: 1-13.
16. Quinn M J. Parallel Computing: Theory and Practice. Second Edition, New York, Mcgraw-Hill, Inc., 1994.
17. Akl S G. Optimal parallel merging and sorting without memory conflicts. IEEE Trans. Comput., 1987, 36(11): 1367-1369.