Quote: use deadline driven scheduling for optimal, dynamic priorities; highest priority to task with nearest deadline; no idle time prior to overflow; best schedulability

Quotation Skeleton

We turn now to study a dynamic scheduling … tasks according to the deadlines of their current … is the nearest, and will be assigned the … . [p. 56] THEOREM 6. When the deadline driven … there is no processor idle time prior to … Theorem 6 will now be used to establish … algorithm is feasible if and only if [the sum of run-time divided by request-time is less than one]. … [p. 58] the deadline driven scheduling algorithm is optimum … can be scheduled by the deadline driven scheduling …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: hard real time systems (64 items)