Optimizing the Resource Requirements of Hierarchical Scheduling Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM SIGBED Review Year : 2016

Optimizing the Resource Requirements of Hierarchical Scheduling Systems

Abstract

Compositional reasoning on hierarchical scheduling systems is a well-founded formal method that can construct schedulable and optimal system configurations in a compositional way. However, a compositional framework formulates the resource requirement of a component, called an interface, by assuming that a resource is always supplied by the parent components in the most pessimistic way. For this reason, the component interface demands more resources than the amount of resources that are really sufficient to satisfy sub-components. We provide two new supply bound functions which provides tighter bounds on the resource requirements of individual components. The tighter bounds are calculated by using more information about the scheduling system. We evaluate our new tighter bounds by using a model-based schedulability framework for hierarchical scheduling systems realized as Uppaal models. The timed models are checked using model checking tools Uppaal and Uppaal SMC, and we compare our results with the state of the art tool CARTS.
Fichier principal
Vignette du fichier
j56.pdf (933.67 Ko) Télécharger le fichier
Origin Publication funded by an institution
Loading...

Dates and versions

hal-01406459 , version 1 (01-12-2016)

Identifiers

Cite

Jin Hyun Kim, Axel Legay, Louis-Marie Traonouez, Abdeldjalil Boudjadar, Ulrik Nyman, et al.. Optimizing the Resource Requirements of Hierarchical Scheduling Systems. ACM SIGBED Review, 2016, 13 (3), pp.41-48. ⟨10.1145/2983185.2983192⟩. ⟨hal-01406459⟩
356 View
120 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More