Vectorization of local search for solving flow-shop scheduling problem on Xeon Phi™ MIC co-processors - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Vectorization of local search for solving flow-shop scheduling problem on Xeon Phi™ MIC co-processors

Abstract

This paper aims to propose a vectorizable cost function for the permutation flow-shop problem (PFSP) with the makespan criterion. This vectorization has been tested on a Xeon Phi core, using a local search. Indeed, Xeon Phi co-processors require vectorization in order to get the best performance from the device. Taillard's benchmark instances are used for the validation of the algorithm. The obtained results show that vectorization is more efficient as the number of jobs and the number of machines increase. Speedups up to 4.5× are recorded.
No file

Dates and versions

hal-01419077 , version 1 (18-12-2016)

Identifiers

Cite

Vaillant Gautier, Mohand Mezmaz, Daniel Tuyttens, Nouredine Melab. Vectorization of local search for solving flow-shop scheduling problem on Xeon Phi™ MIC co-processors. 2016 International Conference on High Performance Computing & Simulation (HPCS), Jul 2016, Innsbruck, Austria. ⟨10.1109/HPCSim.2016.7568407⟩. ⟨hal-01419077⟩
91 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More