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.