Execução Eficiente do Algoritmo de Leilão nas Novas Arquiteturas Multicore release_7oi3vybo5rf7hmtrm676qfi7se

by Alexandre C. Sena, Aline Nascimento, Cristina Vasconcelos, Leandro A. J. Marzulo


NOTE: currently batch computed and may include additional references sources, or be missing recent changes, compared to entity reference list.
Fuzzy reference matching is a work in progress!
Read more about quality, completeness, and caveats in the fatcat guide.
Showing 1 - 16 of 16 references (in 85ms)

via grobid
Bertsekas, D. P. (1979). A distributed algorithm for the assignment problem. Technical report, Lab. for Information and Decision Systems, M.I.T., Cambridge, MA.

via grobid
Bertsekas, D. P. (1992). Auction algorithms for network flow problems: A tutorial intro- duction. Computational Optimization and Applications, 1(1):7-66.

via grobid
Bertsekas, D. P. and Castañon, D. A. (1991). Parallel synchronous and asynchronous implementations of the auction algorithm. Parallel Comput., 17(6-7):707-732.

via grobid
Buš, L. and Tvrdík, P. (2009). Towards auction algorithms for large dense assignment problems. Computational Optimization and Applications, 43(3):411-436.

via grobid
Carpaneto, G., Martello, S., and Toth, P. (1988). Algorithms and codes for the assignment problem. Annals of Operations Research, 13(1):191-223.

via grobid
Chandra, R., Menon, R., Dagum, L., Kohr, D., Maydan, D., and McDonald, J. (2000). Parallel Programming in OpenMP. Morgan Kaufmann, 1st edition.

via grobid
Intel (2007). Intel c++ intrinsic reference. Technical report, Intel.

via grobid
Intel (2017). Intel intrinsics guide. Technical report, Intel.

via grobid
Kollias, G., Sathe, M., Mohammadi, S., and Grama, A. (2013). A fast approach to global alignment of protein-protein interaction networks. BMC Research Notes, 6(1):1-11.

via grobid
Kollias, G., Sathe, M., Schenk, O., and Grama, A. (2012). Fast parallel algorithms for graph similarity and matching. Technical report RR12-010, Department of Computer Science, Purdue University.

via grobid
Kollias, G., Sathe, M., Schenk, O., and Grama, A. (2014). Fast parallel algorithms for graph similarity and matching. Journal of Parallel and Distributed Computing, 74(5):2400 -2410.

via grobid
Mark-Sabahi (2012). A guide to auto-vectorization with intel c++ compilers. Technical report, Intel.

via fuzzy
A Hybrid Parallel Algorithm for the Auction Algorithm in Multicore Systems
A.P. Nascimento, C.N. Vasconcelos, F.S. Jamel, A.C. Sena
2016   Symposium on Computer Architecture and High Performance Computing
doi:10.1109/sbac-padw.2016.21  dblp:conf/sbac-pad/NascimentoVJS16 

via grobid
Sathe, M., Schenk, O., and Burkhart, H. (2012). An auction-based weighted matching implementation on massively parallel architectures. Parallel Computing, 38(12):595 - 614.

via grobid
Shokoufandeh, A. and Dickinson, S. (1999). Applications of bipartite matching to pro- blems in object recognition. In In Proceedings, ICCV Workshop on Graph Algorithms and Computer Vision, page http://www.cs.cornel.

via grobid
Vasconcelos, C. N. and Rosenhahn, B. (2009). Bipartite Graph Matching Computation on GPU. Springer Berlin Heidelberg, Berlin, Heidelberg.