Generation of static tables in embedded memory with dense scheduling

In a real-time context, designing the software relies on insuring deterministic behavior and predictability. With system controlling several sensors and actuators sampled at different rates the scheduling theory associates the notion of Hyperperiod. It is a major factor of complexity whether for scheduling validation (simulation), or for generation of the corresponding tables in the case of pure off-line schedules. This paper presents a compression method of static real-time schedules and a design flow for generating real-time hardware schedulers. The goal is to minimize the size in embedded memory of the scheduling tables defined at compile-time. This method exploits Idle times in multiprocessors systems in order to identify cyclic patterns called dense schedules. When applied to our case studies, the average compression rate of our technique is near 90% of the initial schedules size.