A note on developing optimal and scalable parallel two-list algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7440 LNCS, Issue PART 2, 2012, Pages 148-155

  Chedid, Fouad B ^a,b  

^a DHOFAR UNIVERSITY   (Oman)

^b NOTRE DAME UNIVERSITY   (Lebanon)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLELIZATIONS; PRAM MODELS;

OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

ALGORITHMS;

EID: 84866688638     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33065-0_16     Document Type: Conference Paper

References (16)

1. Akl, S.G.: The Design and Analysis of Parallel Algorithms. Prentice-Hall, Englewood Cliffs (1989)
2. Amirazizi, H.R., Hellman, M.E.: Time Memory Processor trade-offs. IEEE Transactions on Information Theory 34(3), 502-512 (1988)
3. Chang, H.K.-C., Chen, J.J.-R., Shyu, S.-J.: A Parallel Algorithm for the Knapsack Problem Using a Generation and Searching Techniques. Parallel Computing 20(2), 233-243 (1994)
4. n/2). Parallel Computing 34(1), 63-65 (2008)
5. n/2). In: Proceedings of Algorithms and Complexity in Durham, ACiD 2007, King's College, London. Texts in Algorithmics, vol. 9, pp. 35-42 (2007)
6. Cosnard, M., Ferreira, A.G., Herbelin, H.: The Two-List Algorithm for the Knapsack Problem on a FPS T20. Parallel Computing 9(33), 385-388 (1989)
7. n/2) for the Knapsack Problem. IEEE Transactions on Computers 40(2), 221-225 (1991)
8. Ferreira, A.G., Robinson, J.M.: Fast and Scalable Parallel Algorithms for Knapsack- Like Problems. Journal of Parallel and Distributed Computing 49, 1-13 (1996)
9. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
10. Goldman, A., Trystran, D.: An Efficient Parallel Algorithm for Solving the Knapsack Problem on Hypercubes. Journal of Parallel and Distributed Computing 64(11), 1213-1222 (2004)
11. Horowitz, E., Sahni, S.: Computing Partitions With Applications to the Knapsack Problem. Journal of ACM 21(2), 277-292 (1974)
12. Karnin, E.D.: A Parallel Algorithm for the Knapsack Problem. IEEE Transactions on Computers 33(5), 404-408 (1984)
13. Li, K., Li, Q., Hui, W., Jiang, S.: Optimal Parallel Algorithm for the Knapsack Problem Without Memory Conflicts. Journal of Computer Science and Technology 19(6), 760-768 (2004)
14. Lou, D.-C., Chang, C.-C.: A Parallel Two-List Algorithm for the Knapsack Problem. Parallel Computing 22, 1985-1996 (1997)
15. Sanches, C.A.A., Soma, N.Y., Yanasse, H.H.: Comments on Parallel Algorithms for the Knapsack Problem. Parallel Computing 28, 1501-1505 (2002)
16. Sanches, C.A.A., Soma, N.Y., Yanasse, H.H.: An Optimal and Scalable Parallelization of the Two-List Algorithm for the Subset-Sum Problem. European Journal of Operational Research 176, 870-879 (2007).