Real-Time Supervisory Control of a Processor for Non-Preemptive Execution of Periodic Tasks

Authors:
Peter C. Y. Chen;W. M. Wonham
Affiliations:
Bachelor of Technology Programme, Faculty of Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260 engchenp@nus.edu.sg;Department of Electrical and Computer Engineering, University of Toronto, 10 King’s College Road, Toronto, Ontario, Canada M5S 3G4 wonham@control.toronto.edu
Venue:
Real-Time Systems
Year:
2002

Citing 8
Cited 4

On the supermal controllable sublanguage of a given language

SIAM Journal on Control and Optimization
Tutorial: hard real-time systems

Tutorial: hard real-time systems
Scheduling hard real-time systems: a review

Software Engineering Journal - Special issue on real-time software
A decomposition approach to non-preemptive real-time scheduling

Real-Time Systems
Fixed priority pre-emptive scheduling: an historical perspective

Real-Time Systems - Special issue: history of real-time systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
The MSP.RTL real-time scheduler synthesis tool

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Oz Scheduler: A Workbench for Scheduling Problems

ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence

Automatic synthesis of a subclass of schedulers in timed systems

Theoretical Computer Science - Australasian computer science
Real-time preemptive scheduling of sporadic tasks based on supervisory control of discrete event systems

Information Sciences: an International Journal
Schedulability Analysis of Periodic and Sporadic Tasks Using a Timed Discrete Event Model with Memorable Events

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Brief paper: Supervisory control for real-time scheduling of periodic and sporadic tasks with resource constraints

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, a method for scheduling a processor for non-preemptive execution of periodic tasks is presented. This method is based on the formal framework of supervisory control of timed discrete-event systems. It is shown that, with this method, the problem of determining schedulability and the problem of finding a scheduling algorithm are dual since a solution to the former necessarily implies a solution to the latter and vice versa. Furthermore, the solution to the latter thus obtained is complete in the sense that it contains all “safe” sequences of task execution with the guarantee that no deadline is missed. Examples are described to illustrate this method. Implication of the results and computational complexity associated with this method are discussed.