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

Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling

โœ Scribed by Fengxiang Zhang; Alan Burns; Sanjoy Baruah

Book ID
106545826
Publisher
Springer US
Year
2011
Tongue
English
Weight
1001 KB
Volume
47
Category
Article
ISSN
0922-6443

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Online real-time preemptive scheduling o
Online real-time preemptive scheduling of jobs with deadlines on multiple machines
โœ Bhaskar Das Gupta; Michael A. Palis ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Springer US ๐ŸŒ English โš– 139 KB

In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretch factor (or, equivalently, their maximum execution rate r = 1= ). We consider two well-

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