SCT-based priority-free conditionally-preemptive scheduling of modular real-time systems with exact task execution time
- 83 Downloads
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.
KeywordsReal-time systems Supervisory control Conditional preemption Best-case execution time Worst-case execution time
This work was supported in part by the Alexander von Humboldt Foundation, the National Natural Science Foundation of China under Grant No. 61703322, 61673309, and 61603285, and the Science and Technology Development Fund, MSAR, under Grant No. 122/2017/A3.
- Baruah S (2005) The limited-preemption uniprocessor scheduling of sporadic task systems. In: Proceedings of the 17th euromicro conference on real-time systems, pp 137–144Google Scholar
- Nassor E, Bres G (1991) Hard real-time sporadic task scheduling for fixed priority schedulers. In: Proceedings of the international workshop on responsive systems, pp 44–47Google Scholar
- Fei ZN, Reveliotis S, Miremadi S (2015) Åkesson K. A BDD-based approach for designing maximally permissive deadlock avoidance policies for complex resource allocation systems. IEEE Trans Autom Sci Eng 12(3):990–1006Google Scholar
- Mok AK (1983) Fundamental design problems of distributed systems for the hard-real-time environment. Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, CambridgeGoogle Scholar
- Moor T, Schmidt K, Perk S (2008) libFAUDES—an open source C++ library for discrete event systems. In: Workshop on Discrete Event Syst. GöteborgGoogle Scholar
- Wang X, Li ZW, Wonham WM (2016) Dynamic multiple-period reconfiguration of real-time scheduling based on timed DES supervisory control. IEEE Trans Ind Inform 12(1):101–111Google Scholar
- Wang Y, Saksena M (1999) Scheduling fixed-priority tasks with preemption threshold. In: Proceedings of the real-time computing systems and applications, pp 328–335Google Scholar
- Wonham WM, Cai K (2018) Supervisory control of discrete-event systems. Monograph Series Communications and Control Engineering, Springer, 2018, in pressGoogle Scholar