International audienceThis paper deals with the mathematical modelling of a scheduling problem in a heterogeneous CPU/FPGA architecture with communication delay in order to minimize the makespan, Cmax. 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 general form in a heterogeneous case depending at the same time on tasks and computing units. These constraints are linearized without adding any extra variables and the obtained linear model is reduced to make its solving with Cplex 12.5x faster. Computational results show that the proposed model is promising. For an average sized problem up to 50 tasks and 5 computing units the solv...
This paper considers the minimization of the maximum lateness for a set of dependent tasks with unit...
International audienceThis paper presents an efficient algorithm with performance guarantee (approxi...
A set of unit-time tasks has to be processed on an unrestricted number of processors subject to prec...
International audienceThis paper deals with the mathematical modelling of a scheduling problem in a ...
We consider the Multiprocessor Scheduling Problem with Communication Delays, where the delay is prop...
Abstract—Task scheduling is an important aspect of high performance reconfigurable computing. Most o...
This paper adresses certain types of scheduling problems that arise when a parallel computation is t...
International audienceIn this paper we consider scheduling tasks on a multiprocessor system, taking ...
This paper addresses a certain type of scheduling problem that arises when a parallel computation is...
This paper is motivated by existing architectures of field programmable gate arrays (FPGAs). To faci...
We consider the problem of scheduling n unit-length tasks on identical m parallel processors, when o...
We consider the problem of scheduling n unit-length tasks on identical m parallel processors, when o...
The problem of scheduling data transfer across FPGA chips arranged in a grid arises in the design of...
AbstractWe consider the problem of scheduling outforests and inforests with non-uniform deadlines su...
International audienceWe show that the problem of scheduling chains of unit execution time (UET) job...
This paper considers the minimization of the maximum lateness for a set of dependent tasks with unit...
International audienceThis paper presents an efficient algorithm with performance guarantee (approxi...
A set of unit-time tasks has to be processed on an unrestricted number of processors subject to prec...
International audienceThis paper deals with the mathematical modelling of a scheduling problem in a ...
We consider the Multiprocessor Scheduling Problem with Communication Delays, where the delay is prop...
Abstract—Task scheduling is an important aspect of high performance reconfigurable computing. Most o...
This paper adresses certain types of scheduling problems that arise when a parallel computation is t...
International audienceIn this paper we consider scheduling tasks on a multiprocessor system, taking ...
This paper addresses a certain type of scheduling problem that arises when a parallel computation is...
This paper is motivated by existing architectures of field programmable gate arrays (FPGAs). To faci...
We consider the problem of scheduling n unit-length tasks on identical m parallel processors, when o...
We consider the problem of scheduling n unit-length tasks on identical m parallel processors, when o...
The problem of scheduling data transfer across FPGA chips arranged in a grid arises in the design of...
AbstractWe consider the problem of scheduling outforests and inforests with non-uniform deadlines su...
International audienceWe show that the problem of scheduling chains of unit execution time (UET) job...
This paper considers the minimization of the maximum lateness for a set of dependent tasks with unit...
International audienceThis paper presents an efficient algorithm with performance guarantee (approxi...
A set of unit-time tasks has to be processed on an unrestricted number of processors subject to prec...