Abstract

The scheduling problem is becoming an important topic for different fields especially for Real-Time applications. Considering the complexity of Real-Time Embedded Systems (RTES) coupled with the variety of scheduling approaches and algorithms, the designer task is becoming increasingly hard. Few approaches have investigated design patterns to perform an automatic scheduling at a high-level of abstraction. However, only the partitioned scheduling that prevents task migrations has been taken into account. In this context, this paper proposes two design patterns maintaining an automatic choice of semi-partitioned and global scheduling algorithms. The Unified Modeling Language (UML) profile for the Modeling and Analysis of Real-Time Embedded systems (MARTE) is used to annotate the proposed design patterns with functional and non-functional properties.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call