Utilizing slack time for aperiodic and sporadic requests scheduling in real-time systems
Utilizing slack time for aperiodic and sporadic requests scheduling in real-time systems
Scheduler Modeling Based on the Controller Synthesis Paradigm
Real-Time Systems
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling
IEEE Transactions on Computers
Supervisory Control of Software Systems
IEEE Transactions on Computers
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A polynomial dynamic system approach to software design for attractivity requirement
Information Sciences: an International Journal
Decision making in fuzzy discrete event systems
Information Sciences: an International Journal
Brief paper: Supervisory control of modular systems with global specification languages
Automatica (Journal of IFAC)
Multiprocessor scheduling in supervisory control of discrete-event systems framework
Control and Intelligent Systems
Some scheduling problems with general position-dependent and time-dependent learning effects
Information Sciences: an International Journal
Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
Information Sciences: an International Journal
Some single-machine and m-machine flowshop scheduling problems with learning considerations
Information Sciences: an International Journal
Automatica (Journal of IFAC)
Scheduling problems with general effects of deterioration and learning
Information Sciences: an International Journal
Information Sciences: an International Journal
A new algorithm for testing diagnosability of fuzzy discrete event systems
Information Sciences: an International Journal
Hi-index | 0.07 |
This paper presents a preemptive scheduling scheme for real-time systems with sporadic tasks based on the supervisory control theory of discrete event systems. In particular, we present a systematic method of computing a schedulable language that includes all achievable sequences that meet the given deadlines of accepted sporadic tasks. A supervisor that achieves the schedulable language corresponds to a scheduler that can secure the deadlines of all accepted tasks. We further show that the schedulable language includes the decisions on whether a scheduler accepts or rejects a newly arrived sporadic task.