Pgas (partitioned global address space) languages, Encyclopedia of Parallel Computing, pp.1539-1545, 2011. ,
, The landscape of parallel computing research: A view from berkeley, 2006.
A survey of known results and research areas for n-queens, Discrete Mathematics, vol.309, issue.1, pp.1-31, 2009. ,
Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid Testbed, International Journal of High Performance Computing Applications, vol.20, issue.4, pp.481-494, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00684943
Um levantamento na literatura sobre a resolução de problemas de otimização combinatória através do uso de aceleradores gráficos, Proceedings of the XXXV Ibero-Latin American Congress on Computational Methods in Engineering, 2014. ,
GPU-accelerated backtracking using CUDA dynamic parallelism. Concurrency and Computation: Practice and Experience, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01648125
User-defined parallel zippered iterators in chapel, Proceedings of Fifth Conference on Partitioned Global Address Space Programming Models, pp.1-11, 2011. ,
Chapel comes of age: Making scalable programming productive, 2018. ,
Parallel branch-and-bound algorithms. Parallel combinatorial optimization pp, pp.1-28, 2006. ,
Chapel language specification v.986, 2018. ,
, Exascale machines require new programming paradigms and runtimes. Supercomputing frontiers and innovations, vol.2, pp.6-27, 2015.
Nqueens on cuda: Optimization issues, Parallel and Distributed Computing (ISPDC), pp.63-70, 2010. ,
On the road to exascale: Advances in high performance computing and simulationsan overview and editorial, Future Generation Computer Systems, vol.82, pp.450-458, 2018. ,
Ivm-based parallel branch-andbound using hierarchical work stealing on multi-gpu systems, Concurrency and Computation: Practice and Experience, vol.29, issue.9, p.4019, 2017. ,
A survey of parallel search algorithms for discrete optimization problems, ORSA Journal on Computing, vol.7, 1993. ,
A grid-enabled branch and bound algorithm for solving challenging combinatorial optimization problems, IEEE International Parallel and Distributed Processing Symposium, pp.1-9, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00841951
Recent developments in bitparallel algorithms, 2008. ,
Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network, 9th International Parallel Processing Symposium, 1995. Proceedings, pp.182-189, 1995. ,
Branch-and-bound search algorithms and their computational complexity, DTIC Document, 1996. ,