Method and apparatus for scheduling tasks to a cyclic schedule

A non-transitory machine-readable storage medium on which is stored a computer program for scheduling tasks to a cyclic schedule, the computer program, when executed by a computer, causing the computer to perform:

• maintaining a request queue, a count, the count being initialized to a given limit, and an index of a current time slot within the cyclic schedule, wherein periodically:
• if the request queue contains a reference to an urgent task among the tasks, the reference is removed from the request queue and the urgent task is dispatched;
• and
• if the request queue is empty, the index is advanced to the next time slot within the cyclic schedule, wherein:
• if the next time slot is statically assigned to a first task among the tasks, the first task is dispatched, and
• if the next time slot is unassigned and the count is below the given limit, the count is incremented and the index is further advanced to the next but one time slot.

An apparatus adapted to schedule tasks to a cyclic schedule, the apparatus adapted to:

• maintain a request queue, a count, the count being initialized to a given limit, and an index of a current time slot within the cyclic schedule, wherein periodically:
• if the request queue contains a reference to an urgent task among the tasks, the reference is removed from the request queue and the urgent task is dispatched;
• and
• if the request queue is empty, the index is advanced to the next time slot within the cyclic schedule, wherein:
• if the next time slot is statically assigned to a first task among the tasks, the first task is dispatched, and
• if the next time slot is unassigned and the count is below the given limit, the count is incremented and the index is further advanced to the next but one time slot.