SCT-based priority-free conditionally-preemptive scheduling of modular real-time systems with exact task execution time

Wang X, Li Z, Moor T (2019)


Publication Type: Journal article

Publication year: 2019

Journal

DOI: 10.1007/s10626-019-00288-8

Abstract

This study presents a novel discrete-event systems (DES) modeling framework to address real-time system (RTS) with sporadic, periodic, and non-repetitive real-time tasks. Our approach is organized in three steps. First, the effect of individual timing parameters of each task, such as job arrival and deadlines, are represented by modular DES. Second, we choose the required modules for the specific RTS at hand to compose an overall model. Third, we utilize supervisory control to find all schedules that are consistent with the timing requirements of all tasks. In contrast to fixed task priorities, we address general preemption relations represented by a preemption matrix and thereby implement priority-free conditionally-preemptive (PFCP) real-time scheduling. As a particular feature of the closed-loop configuration, the schedules obtained refer to the actual job execution time as opposed to upper and lower bounds. We illustrate our approach by a real-world example in the context of an automated manufacturing system.

Authors with CRIS profile

Involved external institutions

How to cite

APA:

Wang, X., Li, Z., & Moor, T. (2019). SCT-based priority-free conditionally-preemptive scheduling of modular real-time systems with exact task execution time. Discrete Event Dynamic Systems-Theory and Applications. https://dx.doi.org/10.1007/s10626-019-00288-8

MLA:

Wang, Xi, Zhiwu Li, and Thomas Moor. "SCT-based priority-free conditionally-preemptive scheduling of modular real-time systems with exact task execution time." Discrete Event Dynamic Systems-Theory and Applications (2019).

BibTeX: Download