Claire Hanen

Learn More
This paper de nes and studies an approximation algorithm for scheduling tasks with small communication delays onm processors. In a rst step, a schedule 1 for the problem instance with an unlimited number of processors is generated with a polynomial algorithm with relative performance bounded by 2(1 + ) 2 + , where denotes the ratio between the greatest(More)
Timed event graphs (TEGs) and timed weighted event graphs (TWEGs), which have multiple arc cardinalities, have been widely used for automated production systems such as robotic work cells or embedded systems. TWEGs are useful for modeling batch flows of entities such as batch arrivals or processing of jobs. Periodic schedules, that combine an explicit(More)
In this paper, we focus on the resource-constrained modulo scheduling problem, a general periodic scheduling problem, abstracted from the problem solved by compilers when optimizing inner loops at instruction level for VLIW parallel processors. Heuristic solving scheme have been proposed since many years to solve this problem, among which the decomposed(More)
Timed Weighted Event Graphs (in short TWEG) are widely used for modeling industrial problems or embedded systems. The aim of this paper is to develop polynomial algorithms to check the existence of periodic schedules and to compute their optimal throughput. A necessary and sufficient condition of existence of periodic schedules is first expressed. Then, we(More)
Cluster scheduling is a crucial issue in cluster-tree Wireless Sensor Networks (WSNs). The paper presents a methodology that provides a Time Division Cluster Scheduling (TDCS) mechanism based on the shortest path problem. The objective is to meet all the flows' deadlines defined by the maximum number of crossed periods for each flow to reach its destination(More)
In this paper we adress a new cyclic problem: finding periodic schedules for unitary resource constrained cyclic scheduling problem. Such resource constraints are characterized by k, the number of types of functional units employed and mx the maximal number of processors of the same type. The main problem is to cope with both precedence delays and resources(More)
We consider the computation of periodic cyclic schedules for linear precedence constraints graph: a linear precedence constraint is defined between two tasks and induces an infinite set of usual precedence constraints between their executions such the the difference of iterations is a linear function.The objective function is the minimization of the maximal(More)