Optimal Admission Control of Discrete Event Systems with Real-Time Constraints

Authors:
Jianfeng Mao;Christos G. Cassandras
Affiliations:
Division of Systems Engineering and Center for Information and Systems Engineering, Boston University, Brookline, USA 02446;Division of Systems Engineering and Center for Information and Systems Engineering, Boston University, Brookline, USA 02446
Venue:
Discrete Event Dynamic Systems
Year:
2010

Citing 8
Cited 2

Some Results of the Earliest Deadline Scheduling Algorithm

IEEE Transactions on Software Engineering
Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads

IEEE Transactions on Software Engineering
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications

Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Non-Preemptive Scheduling of Real-Time Threads on Multi-Level-Context Architectures

Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
A scheduling model for reduced CPU energy

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Power-Aware Scheduling for Periodic Real-Time Tasks

IEEE Transactions on Computers
An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling

Journal of Scheduling
Optimal Dynamic Voltage Scaling in Energy-Limited Nonpreemptive Systems with Real-Time Constraints

IEEE Transactions on Mobile Computing

On-line Optimal Control of a Class of Discrete Event Systems with Real-Time Constraints

Discrete Event Dynamic Systems
Receding Horizon Control of Mixed Line Flow Shop Systems

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of optimally controlling the processing rate of tasks in Discrete Event Systems with hard real-time constraints has been addressed in prior work under the assumption that a feasible solution exists. Since this cannot generally be the case, we introduce in this paper an admission control scheme in which some tasks are removed with the objective of maximizing the number of remaining tasks which are all guaranteed feasibility. We derive several optimality properties based on which we develop a computationally efficient algorithm for solving this admission control problem under certain conditions. Moreover, when no future task information is available, we derive necessary and sufficient conditions under which idling is optimal and define a metric for evaluating when and how long it is optimal to idle. Numerical examples are included to illustrate our results.