, Top500 HPC international ranking

L. Barreto and M. Bauer, Parallel branch and bound algorithm-a comparison between serial, openmp and mpi implementations, Journal of Physics: Conference Series, vol.256, p.12018, 2010.

I. Chakroun, N. Melab, M. Mezmaz, and D. Tuyttens, Combining multi-core and gpu computing for solving combinatorial optimization problems, Journal of Parallel Distributed Computing, vol.73, issue.12, pp.1563-1577, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00935890

I. Chakroun, M. Mezmaz, N. Melab, and A. Bendjoudi, Reducing thread divergence in a gpu-accelerated branchand-bound algorithm, Concurrency and Computation: Practice and Experience, vol.25, issue.8, pp.1121-1136, 2013.

. Imen-chakroun, Parallel heterogeneous branch and bound algorithms for multi-core and multi-gpu environments, 2013.

G. Chrysos, Intel Xeon Phi X100 Family Coprocessor-the Architecture, Intel, Inc, 2012.

J. Dokulil, E. Bajrovic, S. Benkner, S. Pllana, M. Sandrieser et al., High-level Support for Hybrid Parallel Execution of C++ Applications Targeting Intel R Xeon Phi TM Coprocessors, Procedia Computer Science, vol.18, pp.2508-2511, 2013.

M. R. Garey, D. S. Johnson, and R. Sethi, The complexity of flow-shop and job-shop scheduling, Mathematics of Operations Research, vol.1, pp.117-129, 1976.

S. M. Johnson, Optimal two and three-stage production schedules with setup times included, Naval Research Logistis Quarterly, vol.1, pp.61-68, 1954.

I. M. Kulikov, I. G. Chernykh, A. V. Snytnikov, B. M. Glinskiy, and A. V. Tutukov, Astrophi: A code for complex simulation of the dynamics of astrophysical objects using hybrid supercomputers, Computer Physics Communications, vol.186, pp.71-80, 2015.

V. Kumar, Introduction to Parallel Computing, 2002.

M. E. Lalami, ContributionàContribution`Contributionà la résolution deprobì ems d'optimisation combinatoire: méthodes séquentielles et paralì eles, 2012.

J. K. Lenstra, B. J. Lageweg, and A. H. Rinnooy-kan, A General bounding scheme for the permutation flow-shop problem, Operations Research, vol.26, issue.1, pp.53-67, 1978.

B. Mans and C. Roucairol, Performances of parallel branch and bound algorithms with best-first search, Discrete Applied Mathematics, vol.66, issue.1, pp.57-74, 1996.

N. Melab, I. Chakroun, M. Mezmaz, and D. Tuyttens, A gpu-accelerated branch-and-bound algorithm for the flow-shop scheduling problem, 2012 IEEE Intl. Conf. on Cluster Computing, pp.10-17, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00723736

N. Melab, I. Chakroun, and A. Bendjoudi, Graphics processing unit-accelerated bounding for branch-and-bound applied to a permutation problem using data access optimization. Concurrency and Computation: Practice and Experience, vol.26, pp.2667-2683, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01095244

S. Memeti and S. Pllana, Accelerating DNA Sequence Analysis Using Intel(R) Xeon Phi(TM), Proceedings of the 2015 IEEE Trustcom, vol.03, pp.222-227, 2015.

M. Mezmaz, N. Melab, R. Leroy, and D. Tuyttens, Parallel branch-and-bound using private ivm-based work stealing on xeon phi mic coprocessor, IEEE Proc. of Intl. Conf. on High Performance Computing & Simulation, HPCS'2015, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01248335

S. Saini, H. Jin, D. C. Jespersen, S. Cheung, M. J. Djomehri et al., Early Multi-node Performance Evaluation of a Knights Corner (KNC) based NASA supercomputer, 2015 IEEE Intl. Parallel and Distributed Processing Symposium Workshop, pp.57-67, 2015.

M. Stanic, O. Palomar, I. Ratkovic, M. Duric, O. Unsal et al., Evaluation of Vectorization Potential of Graph500 on Intel Xeon Phi, Proc. of Intl. Conf. on High Performance Computing & Simulation (HPCS'2014), pp.47-54, 2014.

A. Viebke and S. Pllana, The Potential of the Intel (R) Xeon Phi for Supervised Deep Learning, IEEE 7th Intl. Symp. on Cyberspace Safety and Security, and 2015 IEEE 12th Int. Conf. on Embedded Software and Systems, HPCC-CSSICESS '15, pp.758-765, 2015.

T. Vu, Heterogeneity and locality-aware work stealing for large scale branch-and-bound irregular algorithms, 2014.
URL : https://hal.archives-ouvertes.fr/tel-01692204