Documentation/scheduler/sched-deadline.rst

12     3. Scheduling Real-Time Tasks
70  with the "traditional" real-time task model (see Section 3) can effectively
108     said to be "throttled" (also known as "depleted" in real-time literature)
165       real-time guarantees. It therefore enters a transitional state called
168       breaking the real-time guarantees.
302 3. Scheduling Real-Time Tasks
322  suited for periodic or sporadic real-time tasks that need guarantees on their
328  A typical real-time task is composed of a repetition of computation phases
336  A real-time task can be periodic with period P if r_{j+1} = r_j + P, or
339  Summing up, a real-time task can be described as
343  The utilization of a real-time task is defined as the ratio between its
351  WCET_i/P_i over all the real-time tasks in the system. When considering
352  multiple real-time tasks, the parameters of the i-th task are indicated
355  non- real-time tasks by real-time tasks.
356  If, instead, the total utilization is smaller than M, then non real-time
375  real-time task is statically assigned to one and only one CPU), it is
442  real-time literature[8,9], but they are not based on a simple comparison
452  about schedulability tests for multi-processor real-time scheduling can be
458  a total utilization smaller than M is enough to guarantee that non real-time
459  tasks are not starved and that the tardiness of real-time tasks has an upper
461  experienced by real-time tasks have been developed in various papers[13,14],
471  deadline and period) and the real-time task parameters (WCET, D, P)
477  are respected, then SCHED_DEADLINE can be used to schedule real-time tasks
495       ming in a hard-real-time environment. Journal of the Association for
498       Real-Time Systems. Proceedings of the 19th IEEE Real-time Systems
503       Periodic, Real-Time Tasks. Information Processing Letters, vol. 11,
506       Hard-Real-Time Sporadic Tasks on One Processor. Proceedings of the
507       11th IEEE Real-time Systems Symposium, 1990.
509       Concerning the Preemptive Scheduling of Periodic Real-Time tasks on
510       One Processor. Real-Time Systems Journal, vol. 4, no. 2, pp 301-324,
512   7 - S. J. Dhall and C. L. Liu. On a real-time scheduling problem. Operations
515       Analysis. Proceedings of the 24th IEEE Real-Time Systems Symposium, 2003.
520        Periodic Task Systems on Multiprocessors. Real-Time Systems Journal,
522   11 - R. Davis and A. Burns. A Survey of Hard Real-Time Scheduling for
526        Scheduling on a Multiprocessor. Real-Time Systems Journal, vol. 32,
529        Real-Time Tasks Scheduled by EDF on Multiprocessors. Proceedings of
530        the 26th IEEE Real-Time Systems Symposium, 2005.
533        Real-Time Systems, 2010.
535        constant-bandwidth servers, 12th IEEE Euromicro Conference on Real-Time
538        SCHED DEADLINE. In Proceedings of the Real-Time Linux Workshop (RTLWS),
546   19 - C. Scordino, L. Abeni, J. Lelli, Energy-Aware Real-Time Scheduling in
562  correctly schedule a set of real-time tasks is that the total utilization
566  of a "traditional" real-time task, and is also often referred to as
570  tasks with real-time group scheduling (a.k.a. RT-throttling - see
729  workloads (maybe mimicking real use-cases) and evaluate how the scheduler
770  showing how SCHED_DEADLINE reservations can be created by a real-time