A GPU-enabled solver for time-constrained linear sum assignment problems

INFOS2010 - 2010 7th International Conference on Informatics and Systems

Volumn , Issue , 2010, Pages

  Roverso, Roberto ^a,b   Naiem, Amgad ^a,c,d   El Beltagy, Mohammed ^a,c,d   El Ansary, Sameh ^a   Haridi, Seif ^b  

^a Peerialism Inc   (Sweden)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^c CAIRO UNIVERSITY   (Egypt)

^d NILE UNIVERSITY   (Egypt)

Author keywords

[No Author keywords available]

Indexed keywords

ASSIGNMENT PROBLEMS; GRAPHICAL PROCESSING UNITS; HUNGARIANS; LIVE STREAMING; OPTIMALITY; PARALLEL VERSION; PERFORMANCE GAIN; PROGRAMMING LANGUAGE; REAL TIME CONSTRAINTS;

HEURISTIC ALGORITHMS; INDUSTRIAL APPLICATIONS; INFORMATION SCIENCE; PARALLEL PROGRAMMING; PROGRAM PROCESSORS; TRAVELING SALESMAN PROBLEM;

PROBLEM ORIENTED LANGUAGES;

EID: 77953175019     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. A. Naiem and M. El-Beltagy, "Deep greedy switching: A fast and simple approach for linear assignment problems," in 7th International Conference of Numerical Analysis and Applied Mathematics, 2009.
2. M. Garland, S. Le Grand, J. Nickolls, J. Anderson, J. Hardwick, S. Morton, E. Phillips, Y. Zhang, and V. Volkov, "Parallel computing experiences with cuda," Micro, IEEE, vol. 28, no. 4, pp. 13-27, 2008. [Online]. Available: http://dx.doi.org/10.1109/MM.2008.57
3. K. Group. Opencl: The open standard for parallel programming of heterogeneous systems. [Online]. Available: http://www.khronos.org/opencl/
4. E. Lindholm, J. Nickolls, S. Oberman, and J. Montrym, "Nvidia tesla: A uni.ed graphics and computing architecture," Micro, IEEE, vol. 28, no. 2, pp. 39-55, May 2008. [Online]. Available: http://dx.doi.org/10.1109/MM.2008. 31
5. A. Bayoumi, M. Chu, Y. Hanafy, P. Harrell, and G. Refai-Ahmed, "Scienti.c and engineering computing using ati stream technology," Computing in Science and Engineering, vol. 11, pp. 92-97, 2009.
6. H. W. Kuhn, "The hungarian method for the assignment problem," Naval Research Logistics Quarterly, vol. 2, pp. 83-97, 1955.
7. D. Bertsekas, "The auction algorithm: A distributed relaxation method for the assignment problem," Annals of Operations Research, vol. 14, no. 1, pp. 105-123, 1988.
8. L. Bus and P. Tvrdik, "Distributed Memory Auction Algorithms for the Linear Assignment Problem," in Proceedings of 14th IASTED International Conference of Parallel and Distributed Computing and Systems, 2002, pp. 137-142.