Lines Matching refs:real

64  with the "traditional" real-time task model (see Section 3) can effectively
102     said to be "throttled" (also known as "depleted" in real-time literature)
130  suited for periodic or sporadic real-time tasks that need guarantees on their
136  A typical real-time task is composed of a repetition of computation phases
144  A real-time task can be periodic with period P if r_{j+1} = r_j + P, or
147  Summing up, a real-time task can be described as
150  The utilization of a real-time task is defined as the ratio between its
158  WCET_i/P_i over all the real-time tasks in the system. When considering
159  multiple real-time tasks, the parameters of the i-th task are indicated
162  non- real-time tasks by real-time tasks.
163  If, instead, the total utilization is smaller than M, then non real-time
180  real-time task is statically assigned to one and only one CPU), it is
243  real-time literature[8,9], but they are not based on a simple comparison
251  about schedulability tests for multi-processor real-time scheduling can be
257  a total utilization smaller than M is enough to guarantee that non real-time
258  tasks are not starved and that the tardiness of real-time tasks has an upper
260  experienced by real-time tasks have been developed in various papers[13,14],
270  deadline and period) and the real-time task parameters (WCET, D, P)
276  are respected, then SCHED_DEADLINE can be used to schedule real-time tasks
293       ming in a hard-real-time environment. Journal of the Association for
310   7 - S. J. Dhall and C. L. Liu. On a real-time scheduling problem. Operations
345  correctly schedule a set of real-time tasks is that the total utilization
349  of a "traditional" real-time task, and is also often referred to as
353  tasks with real-time group scheduling (a.k.a. RT-throttling - see
487  workloads (maybe mimicking real use-cases) and evaluate how the scheduler
530  showing how SCHED_DEADLINE reservations can be created by a real-time