Periodic Resource Model for Compositional Real-Time Guarantees

  • Authors:
  • Insik Shin;Insup Lee

  • Affiliations:
  • -;-

  • Venue:
  • RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We address the problem of providing compositional hardreal-time guarantees in a hierarchy of schedulers. We firstpropose a resource model to characterize a periodic resourceallocation and present exact schedulability conditionsfor our proposed resource model under the EDF andRM algorithms. Using the exact schedulability conditions,we then provide methods to abstract the timing requirementsthat a set of periodic tasks demands under the EDF and RMalgorithms as a single periodic task. With these abstractionmethods, for a hierarchy of schedulers, we introduce acomposition method that derives the timing requirements ofa parent scheduler from the timing requirements of its childschedulers in a compositional manner such that the timingrequirement of the parent scheduler is satisfied, if and onlyif, the timing requirements of its child schedulers are satisfied.