Fast block distributed CUDA implementation of the Hungarian algorithm

Journal of Parallel and Distributed Computing - Tập 130 - Trang 50-62 - 2019
Paulo A.C. Lopes1, Satyendra Singh Yadav2, Aleksandar Ilic1, Sarat Kumar Patra3
1Instituto de Engenharia de Sistemas e Computadores, Investigação e Desenvolvimento, Instituto Superior Técnico, Universidade de Lisboa, INESC-ID/IST/UL, Rua Alves Redol n.9, 1000-029 Lisbon, Portugal
2Department of Electronics and Communication Engineering, National Institute of Technology Rourkela, Odisha, India
3Department of Computer Science Engineering, Indian Institute of Information Technology, Vadodara, India

Tài liệu tham khảo

Munkres, 1957, Algorithms for the assignment and transportation problems, J. Soc. Ind. Appl. Math., 5, 32, 10.1137/0105003 Bertsekas, 1990, The auction algorithm for assignment and other network flow problems: A tutorial, Interfaces, 20, 133, 10.1287/inte.20.4.133 Jonker, 1987, A shortest augmenting path algorithm for dense and sparse linear assignment problems, Computing, 38, 325, 10.1007/BF02278710 Lawler, 1976 Date, 2016, GPU-accelerated Hungarian Algorithms for the linear assignment problem, Parallel Comput., 57, 52, 10.1016/j.parco.2016.05.012 Balas, 1991, A parallel shortest augmenting path algorithm for the assignment problem, J. ACM, 38, 985, 10.1145/115234.115349 Bertsekas, 1993, Parallel asynchronous Hungarian methods for the assignment problem, ORSA J. Comput., 5, 261, 10.1287/ijoc.5.3.261 Bertsekas, 1991, Parallel synchronous and asynchronous implementations of the auction algorithm, Parallel Comput., 17, 707, 10.1016/S0167-8191(05)80062-6 Sathe, 2012, An auction-based weighted matching implementation on massively parallel architectures, Parallel Comput., 38, 595, 10.1016/j.parco.2012.09.001 Zavlanos, 2008, A distributed auction algorithm for the assignment problem, 1212 Vasconcelos, 2009, Bipartite graph matching computation on GPU, 42 Azad, 2011, Computing maximum matching in parallel on bipartite graphs: worth the effort?, 11 Deveci, 2013, GPU Accelerated maximum cardinality matching algorithms for bipartite graphs, 850 Lawer, 1985 H. Yin, H. Liu, An efficient multiuser loading algorithm for OFDM-based broadband wireless systems, in: Global Telecommunications Conference, 2000. GLOBECOM’00. IEEE, vol. 1, IEEE, 2000, pp. 103–107. Pentico, 2007, Assignment problems: A golden anniversary survey, European J. Oper. Res., 176, 774, 10.1016/j.ejor.2005.09.014 Burkard, 2009 Biggs, 1976 2007 P.A.C. Lopes, S.S. Yadav, A. Ilic, S.K. Patra, HungarianGPU on GitHub, http://github.com/paclopes/HungarianGPU. Harris, 2007, Optimizing parallel reduction in CUDA, NVIDIA Dev. Technol., 2