Skip to Main content Skip to Navigation
New interface
Conference papers

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

Abstract : 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.
Complete list of metadata

https://hal.univ-lorraine.fr/hal-01883150
Contributor : Camille Diou Connect in order to contact the contributor
Submitted on : Thursday, September 27, 2018 - 5:20:21 PM
Last modification on : Monday, January 24, 2022 - 11:42:43 AM

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

40