๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks

โœ Scribed by Sanjoy K. Baruah

Book ID
110410523
Publisher
Springer US
Year
2003
Tongue
English
Weight
494 KB
Volume
24
Category
Article
ISSN
0922-6443

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Static priority scheduling of aperiodic
Static priority scheduling of aperiodic real-time tasks
โœ Ulrich Schmid ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 525 KB

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 tas

Fixed priority scheduling of tasks with
Fixed priority scheduling of tasks with arbitrary precedence constraints in distributed hard real-time systems
โœ Romulo Silva de Oliveira; Joni da Silva Fraga ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 219 KB

This paper considers the schedulability analysis of real-time distributed applications where tasks may present arbitrary precedence relations. It is assumed that tasks are periodic or sporadic and dynamically released. They have ยฎxed priorities and hard end-to-end deadlines that are equal to or less