METHOD AND APPARATUS FOR SCHEDULING TASKS TO A CYCLIC SCHEDULE

Method (10) for scheduling tasks to a cyclic schedule (11), comprising maintaining a request queue (12), a count, the count being initialized to a given limit, and an index (13) of a current time slot within the schedule (11), characterized in that, periodically, - if the request queue (12) contains a reference to an urgent task among the tasks (14, Y), that reference is removed from the request queue (12) and the urgent task is dispatched (15) and - if the request queue (12) is empty (14, N), the index (13) is advanced (16) to the next time slot within the schedule (11), i. if the next time slot is statically assigned to a task among the tasks (17, Y), that task is dispatched (18), and ii. if the next time slot is unassigned (17, N) and the count is below the limit (19, N), the count is incremented and the index (13) is further advanced (20) to the next but one time slot.