Une courbe se service résiduelle calculable en temps quadratique pour le calcul réseau
Marc Boyer, Pierre Le Roux, Daigmorte, Hugo, Puechmaille, David · HAL (Le Centre pour la Communication Scientifique Directe) · 2024
Computing response times for resources shared by periodic workloads (tasks or data flows) can be very time consuming as it depends on the least common multiple of the periods. In a previous study, a quadratic algorithm was provided to upper bound the response time of a set a periodic tasks with fixed-priority scheduling. This paper generalises this result by giving not only a response time but a residual curve, that can be used in other contexts. It also provides a formal proof in the Coq language.