Krono-Safe

Adrien Barbot

Vincent David

Emmanuel Ohayon

A method for constructing off-line a sequencing plan for a plurality of tasks executed on a real-time system, including decomposing each task into a sequence of frames, where each frame is associated with an elementary process having an execution need, and defines a start date from which the process can start and an end date, or deadline, at which the process must complete; associating respective order constraints with pairs of processes; projecting the dates on a time scale associated with an execution unit of the real-time system, thus forming a sequence of time slots; sequentially parsing the time slots of the sequence; identifying eligible processes in a current time slot, a process being eligible if it meets the following two criteria: i) it is executable in the current time slot, and ii) if it has an order constraint.

Method for executing sequencing plans ensuring low-latency communication between real-time tasks

A method for executing two tasks in timesharing, includes: decomposing offline each task in a repetitive sequence of consecutive frames, and defining a start date and deadline by which an associated atomic operation must respectively start and end; verifying for each frame of a first of the repetitive sequences the corresponding operation can be performed between any two successive operations of a group of frames of the second repetitive sequence, overlapping the first repetitive sequence frame; and if the verification is satisfied, allowing the execution of the two tasks. Scheduling the operations of the two tasks, if two operations can start, executing the operation having the shorter deadline; and if a single operation can start, executing it if its execution need is less than the time remaining until the next frame start date of the other sequence, plus the time margin associated with the next frame of the other sequence.

Growing community of inventors

Palaiseau, France

Adrien Barbot