Subsystem-Interface Generation in the Presence of Shared Resources

• The Hierarchical Scheduling Framework (HSF) has been introduced as a design-time framework enabling compositional schedulability analysis of embedded software systems with real-time properties. However, supporting resource sharing in HSF is a major challenge, since it increases the amount of the CPU resources required to guarantee the schedulability of the hard real time tasks and decreases the composability at the system level. In this paper, we discuss and identify the key parameters of a compositional framework called the bounded-delay resource open environment (BROE) server to support global resource sharing, that have a great effect on how the framework will utilize CPU resources. Furthermore, we provide an algorithm, that has a pseudo-polynomial complexity, to evaluate the ”optimal” setting for the BROE server. In addition, we provide a polynomial-time approximation algorithm for generating near-optimal setting for the BROE server. The performance of the BROE server, as well as the efficiency of the approximated algorithm, is evaluated by the means of simulation analysis.

Publication and Content Type

ref (subject category)

kon (subject category)