A comparison of two metaheuristic algorithms for scheduling problem on a heterogeneous CPU/FPGA architecture with communication delays - Université de Lorraine Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

A comparison of two metaheuristic algorithms for scheduling problem on a heterogeneous CPU/FPGA architecture with communication delays

Résumé

This paper considers the problem of scheduling on a heterogeneous CPU/FPGA architecture with communication delays, with the aim of minimizing the makespan (or the schedule length). For this strongly NP-hard problem, we present two iterative algorithms based on simulated annealing (SA) and genetic algorithms (GAs), which are used to run in the MPSoC an application described in a data flow graph. The performance of the proposed algorithms are evaluated and compared on a set of instances with up to 50 tasks. Computational experiments indicate that the innovative proposed algorithms provide competitive results for the studied problem and that the objective function values obtained are optimal or very close to a lower bound in a reasonable computation time.
Fichier non déposé

Dates et versions

hal-01883150 , version 1 (27-09-2018)

Identifiants

Citer

Fadel Abdallah, Camel Tanougast, Imed Kacem, Camille Diou, Daniel Singer. A comparison of two metaheuristic algorithms for scheduling problem on a heterogeneous CPU/FPGA architecture with communication delays. 2017 4th International Conference on Control, Decision and Information Technologies (CoDIT), Apr 2017, Barcelona, France. ⟨10.1109/CoDIT.2017.8102607⟩. ⟨hal-01883150⟩
58 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More