Dense dynamic programming on multi GPU

Proceedings - 19th International Euromicro Conference on Parallel, Distributed, and Network-Based Processing, PDP 2011

Volumn , Issue , 2011, Pages 545-551

  Boyer, Vincent ^a,b   El Baz, Didier ^a,b   Elkihel, Moussa ^a,b  

^a LAAS CNRS   (France)

^b UNIVERSITÉ PAUL SABATIER   (France)

Author keywords

combinatorial optimization; CUDA; dynamic programming; hybrid computing; knapsack problems; multi GPU architectures

Indexed keywords

COMPUTATIONAL RESULTS; COMPUTING SYSTEM; CUDA; DYNAMIC PROGRAMMING METHODS; HYBRID COMPUTING; KNAPSACK PROBLEMS; MULTI GPU ARCHITECTURES; SPEED-UP FACTORS;

CLUSTER COMPUTING; COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; NETWORK ARCHITECTURE; PROGRAM PROCESSORS;

DYNAMIC PROGRAMMING;

EID: 79955046362     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PDP.2011.25     Document Type: Conference Paper

References (21)

1. NVIDIA, "Cuda 2.0 programming guide," http://developer. download.nvidia.com/compute/cuda/2-0/docs/NVI-DIA-CUDA-Programming-Guide-2.0. pdf, 2009.
2. D. El Baz and M. Elkihel, "Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem," Journal of Parallel and Distributed Computing, vol. 65, pp. 74-84, 2005. (Pubitemid 40079243)
3. D. C. Lou and C. C. Chang, "A parallel two-list algorithm for the knapsack problem," Parallel Computing, vol. 22, pp. 1985-1996, 1997.
4. T. E. Gerash and P. Y. Wang, "A survey of parallel algorithms for one-dimensional integer knapsack problems," INFOR, vol. 32(3), pp. 163-186, 1993.
5. G. A. P. Kindervater and H. W. J. M. Trienekens, "An introduction to parallelism in combinatorial optimization," Parallel Computers and Computations, vol. 33, pp. 65-81, 1988.
6. J. Lin and J. A. Storer, "Processor-efficient algorithms for the knapsack problem," Journal of Parallel and Distributed Computing, vol. 13(3), pp. 332-337, 1991.
7. D. Ulm, "Dynamic programming implementations on SIMD machines - 0/1 knapsack problem," M.S. Project, George Mason University, 1991.
8. V. Boyer, D. El Baz, and M. Elkihel, "Solving knapsack problems on gpu," LAAS report 10009, 2010.
9. T. Van Luong, N. Melab, and E. G. Talbi, "Large neighborhood local search optimization on graphics processing units," in Proc. of the 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010), D. Bader, Ed. Atlanta, USA, April 2010.
10. V. Boyer, D. El Baz, and M. Elkihel, "Heuristics for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, vol. 199, issue 3, pp. 658-664, 2009.
11. B. L. Dietrich and L. F. Escudero, "More coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds," IBM T.J. Watson Research Center, vol. RC-14389, Yorktown Heights (NY), 1989.
12. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems. Springer, 2004.
13. S. Martello and P. Toth, Knapsack Problems - Algorithms and Computer Implementations. Wiley & Sons, 1990.
14. R. Bellman, "Dynamic programming," Princeton University Press, 1957.
15. P. Toth, "Dynamic programming algorithm for the zero-one knapsack problem," Computing, vol. 25, pp. 29-45, 1980. (Pubitemid 11438248)
16. CINES, "Iblis cluster," http://www.cines.fr/spip.php? article504.
17. NVIDIA, "S1070 tesla gpu computing system specification," http://www.nvidia.com/docs/IO/43395/SP-04154-001v02.pdf, October 2008.
18. D. El Baz, "Knapsack benchmark," http://www.laas.fr/CDA-EN/45- 31329-Knapsack-problems.php, 2010.
19. -, "Nvidia academic partnership, october 2010," http://projects.laas.fr/NVIDIAacademic.
20. T. T. Nguyen, D. El Baz, P. Spitéri, J. Jourjon, and M. Chau, "High performance peer-to-peer distributed computing with application to obstacle problem," in Proc. of the 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010), D. Bader, Ed. Atlanta, USA, April 2010.
21. D. El Baz, "Anr project cip," http://spiderman-2.laas.fr/CIS- CIP, 2008.