GPU implementation of a parallel two-list algorithm for the subset-sum problem

Concurrency and Computation: Practice and Experience

Volumn 27, Issue 1, 2015, Pages 119-145

  Wan, Lanjun ^a   Li, Kenli ^a,b   Liu, Jing ^a   Li, Keqin ^a,b,c  

^a HUNAN UNIVERSITY   (China)

^b National Supercomputing Center in Changsha   (China)

^c STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

CUDA; GPU implementation; Knapsack problem; Parallel two list algorithm; Subset sum problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER GRAPHICS; COMPUTER GRAPHICS EQUIPMENT; ITERATIVE METHODS; NP-HARD; POLYNOMIAL APPROXIMATION; PROGRAM PROCESSORS;

CUDA; GPU IMPLEMENTATION; KNAPSACK PROBLEMS; LIST ALGORITHMS; SUBSET SUM PROBLEMS;

GRAPHICS PROCESSING UNIT;

EID: 84919463060     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.3201     Document Type: Article

References (24)

1. Gary MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman and Company: New York, 1979.
2. Dietrich BL, Escudero LF, Chance F. Efficient reformulation for 0-1 programs-methods and computational results. Discrete Applied Mathematics 1993; 42(2):147-175.
3. Dyckhoff H. A new linear programming approach to the cutting stock problem. Operations Research 1981; 29(6):1092-1104.
4. Kleywegt AJ, Papastavrou JD. The dynamic and stochastic knapsack problem with random sized items. Operations Research 2001; 49(1):26-41.
5. Martello S, Toth P. Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, Inc.: New York, NY, 1990.
6. Horowitz E, Sahni S. Computing partitions with applications to the knapsack problem. Journal of the ACM (JACM) 1974; 21(2):277-292.
7. Bellman RE. Dynamic Programming. Princeton University Press: Princeton, New Jersey, 1957.
8. Schroeppel R, Shamir A. A T=O.2n=2), S=O.2n=4) algorithm for certain NP-complete problems. SIAM Journal on Computing 1981; 10(3):456-464.
9. Karnin ED. A parallel algorithm for the knapsack problem. IEEE Transactions on Computers 1984; 100(5):404-408.
10. Ferreira AG. A parallel time/hardware tradeoff T-H D O.2n=2/for the knapsack problem. IEEE Transactions on Computers 1991; 40(2):221-225.
11. Chang HKC, Chen JJR, Shyu SJ. A parallel algorithm for the knapsack problem using a generation and searching technique. Parallel Computing 1994; 20(2):233-243.
12. Lou DC, Chang CC. A parallel two-list algorithm for the knapsack problem. Parallel Computing 1997; 22(14):1985-1996.
13. Sanches CAA, Soma NY, Yanasse HH. Comments on parallel algorithms for the knapsack problem. Parallel Computing 2002; 28(10):1501-1505.
14. Sanches CAA, Soma NY, Yanasse HH. An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem. European Journal of Operational Research 2007; 176(2):870-879.
15. Chedid FB. An optimal parallelization of the two-list algorithm of cost O.2n=2/. Parallel Computing 2008; 34(1):63-65.
16. Chedid FB. A note on developing optimal and scalable parallel two-list algorithms. In Algorithms and Architectures for Parallel Processing. Springer-Verlag: Berlin, 2012; 148-155.
17. Li KL, Li RF, Li QH. Optimal parallel algorithms for the knapsack problem without memory conflicts. Journal of Computer Science and Technology 2004; 19(6):760-768.
18. Ryoo S, Rodrigues CI, Stone SS, Stratton JA, Ueng SZ, Baghsorkhi SS, Hwu WmW. Program optimization carving for GPU computing. Journal of Parallel and Distributed Computing 2008; 68(10):1389-1401.
19. Che S, Boyer M, Meng J, Tarjan D, Sheaffer JW, Skadron K. A performance study of general-purpose applications on graphics processors using CUDA. Journal of Parallel and Distributed Computing 2008; 68(10):1370-1380.
20. Bokhari SS. Parallel solution of the subset-sum problem: An empirical study. Concurrency and Computation: Practice & Experience 2012; 24(18):2241-2254.
21. Boyer V, El Baz D, Elkihel M. Solving knapsack problems on GPU. Computers & Operations Research 2012; 39(1):42-47.
22. Lalami ME, El-Baz D. GPU implementation of the Branch and Bound method for knapsack problems. 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), IEEE, Shanghai, China, 2012; 1769-1777.
23. Pospíchal P, Schwarz J, Jaros J. Parallel genetic algorithm solving 0/1 knapsack problem running on the gpu. 16th International Conference on Soft Computing MENDEL, Brno, Czech Republic, 2010; 64-70.
24. Akl SG, Santoro N. Optimal parallel merging and sorting without memory conflicts. IEEE Transactions on Computers 1987; 100(11):1367-1369.