Can I read Static Priority Scheduling of Aperiodic Real-time Tasks on EtoBox?

Static Priority Scheduling of Aperiodic Real-time Tasks by Ulrich Schmid is a Mathematics article available to read on EtoBox.

What is Static Priority Scheduling of Aperiodic Real-time Tasks about?

We investigate deadline meeting properties of the well-known preemptive Ž . static priority scheduling SPS algorithm, which is widespreadly used in commercial real-time operating system kernels. A discrete-time single server queueing system employing SPS for scheduling probabilistically arriving tasks at L priority levels is considered for this purpose. Ž . Ž . Ž . Model parameters are arrival and execution-time distribution A z , L z and a constant l l l l Ž deadline T g T T per level l. By means of a combinatorial technique which does not require l l L . Ž . stable-state assumptions , we determine the probability distribution of the random-time the system operates without violating any task's deadline. This distribution is asymptotically exponential with parameter , which decreases exponentially with the deadlines T T ; simple T T L L Ž . asymptotic expressions for and all associated quantities probabilities, moments, . . . for T T L large T T are provided. Our numerical examples suggest that real-time systems based on SPS L Ž . operate reasonably well only if computing performance is more than adequate. ᮊ 1997

Who reads Static Priority Scheduling of Aperiodic Real-time Tasks?

Author

Ulrich Schmid

Publisher

John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 1042-9832)

Published

1997

Language

EN

Field

Mathematics (Physical Sciences)