Automatic Generation of Cyclic Schedules

Abstract Many real-time systems have strict safety requirements or constraints in their computational resources, and fixed-priority scheduling cannot be used in their development. Thus, these systems are developed using cyclic scheduling, which has been the prevailing technique in industry for a long time. However, cyclic scheduling also have serious problems, the most important is the complexity of building cyclic schedules, which makes it difficult and costly to develop and maintain. So, it is an industrial interest to automatically generate feasible cyclic schedules. This paper describes an algorithm which builds feasible schedules from the cyclic schedule structure obtained by Baker and Shaw equations. This algorithm uses heuristics for directing the search to a feasible solution. Also, it is investigated with a prototype tool applied to a set of case studies.