Optimal Control for Real-Time Feedback Rate-Monotonic Schedulers
نویسندگان
چکیده
This paper presents an optimal control scheme for a realtime feedback control rate-monotonic scheduling (FC-RMS) system. We consider two-version tasks composed of a mandatory and an optional part to be scheduled according to the FC-RMS. In FC-RMS, the controller provides a feedback strategy for deciding about the execution or rejection of the optional sub-tasks. By modeling the task execution times as random variables, we first find the statistical model of FC-RMS and then we design a pure optimal controller and an optimal controller with feedforward integral compensation. The comparison of these two schemes with common Proportional-Integral-Derivative (PID) controller highlights the benefit of the optimal scheme with integral compensation. The results are demonstrated through the real implementation of FC-RMS on RT-Linux.
منابع مشابه
Fast Admission Control for Rate Monotonic Schedulers
Rate monotonic traffic scheduling algorithm had been shown [1] to be the optimal static priority assignment scheme. The system model studied in [1] can be considered (although not realistic) as a preemptive multiplexer which accepts constant bit rate connections that generate packets periodically. The multiplexer adopts a service discipline such that a lower priority packet can be preempted at ...
متن کاملAn Omniscient Scheduling Oracle for Systems with Harmonic Periods
Most real-time scheduling problems are known to be NP-complete. To enable accurate comparison between the schedules of heuristic algorithms and the optimal schedule, we introduce an omniscient oracle. This oracle provides schedules for periodic task sets with harmonic periods and variable resource requirements. Three di erent job value functions are described and implemented. Each corresponds t...
متن کاملA Feedback-Controlled EDF Scheduling Algorithm for Real- time Multimedia Transmission
Real-time communication is important for time-critical multimedia applications. However, conventional real-time schedulers such as EDF (Earliest Deadline First) and RM (Rate Monotonic) are designed for task sets with sophisticated characteristics. They can perform well in the idea network with precise workloads. But, in a realistic network with shared bandwidth and unpredictable workloads, thei...
متن کاملPlanificadores de tareas en Tiempo Real Concurrentes: Una Clasificación basada en Funciones y Teoría de Conjuntos
Real-Time Operating Systems must provide support for concurrency; to achieve this, task schedulers are necessary. Schedulers operate on a set of concurrent real-time tasks in which its instances are to complete their execution within their respective deadlines; a scheduler receives a set of arrival times and maps it to a set of start times for the instances to begin their execution. In this con...
متن کاملAllocating and scheduling tasks in multiple fieldbus real-time systems
We consider real-time systems connected via several fieldbuses. Validating such systems consists in prooving that tasks meet their end-to-end deadlines. Tasks are scheduled on processors by fixed-priority schedulers. We propose an automatic method for allocating tasks on processors and assigning priorities to tasks so that every deadline is met. Allocation and scheduling are simultaneously achi...
متن کامل