Lines Matching refs:P

125  * satisfied :P) to be sure of fully understanding all technical details.
144  A real-time task can be periodic with period P if r_{j+1} = r_j + P, or
145  sporadic with minimum inter-arrival time P is r_{j+1} >= r_j + P. Finally,
148 	Task = (WCET, D, P)
227  CPUs, with the first task Task_1=(P,P,P) having period, relative deadline
228  and WCET equal to P. The remaining M tasks Task_i=(e,P-1,P-1) have an
232  (because their absolute deadlines are equal to t + P - 1, hence they are
233  smaller than the absolute deadline of Task_1, which is t + P). As a
235  time t + e + P, after its absolute deadline. The total utilization of the
236  task set is U = M · e / (P - 1) + P / P = M · e / (P - 1) + 1, and for small
270  deadline and period) and the real-time task parameters (WCET, D, P)
282   - period <= P
284  IOW, if runtime >= WCET and if period is <= P, then the scheduling deadlines
326   13 - P. Valente and G. Lipari. An Upper Bound to the Lateness of Soft