Mathematical programming models for scheduling in a CPU/FPGA architecture with heterogeneous communication delays

This paper deals with the mathematical modelling of a scheduling problem in a heterogeneous cpu/fpga architecture with heterogeneous communication delays in order to minimize the makespan, $$c_{max}$$ . this study was motivated by the quality of the available solvers for mixed integer program. the proposed model includes the communication delay constraints in a heterogeneous case, depending on both tasks and computing units. these constraints are linearized without adding any extra variables and the obtained linear model is reduced to speed-up the solving with cplex up to 60 times. computational results show that the proposed model is promising. for an average sized problem of up to 50 tasks and five computing units the solving time under cplex is a few seconds.