Technique de réduction d'ordonnancements hors-ligne pour applications embarquées à contraintes temps réel
Résumé
This article presents an optimization technic of static real-time scheduling. The goal is to minimize the size in embedded memory of the scheduling tables defined at compile-time. This compression of the results of classical scheduling algorithms exploits Idle times in multiprocessors systems in order to identify cyclic patterns. The proposed approach is based on a compact description format near to the Synchronous Data Flow Graphs (SDFG). When applied to our case studies, the average compression rate of our technic is near to 70% of the initial schedule size.