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

Scheduling of computational processes in real-time distributed systems with uncertain task execution times

โœ Scribed by N. V. Kolesov, M. V. Tolmacheva, P. V. Yukhta

Book ID
118725163
Publisher
SP MAIK Nauka/Interperiodica
Year
2012
Tongue
English
Weight
431 KB
Volume
51
Category
Article
ISSN
1064-2307

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Minimal schedulability interval for real
Minimal schedulability interval for real-time systems of periodic tasks with offsets
โœ Annie Choquet-Geniet; Emmanuel Grolleau ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 286 KB

We consider real-time systems in highly safety context where tasks have to meet strict deadlines. Tasks are periodic, may have o sets, share critical resources and be precedence constrained. O -line scheduling should be of great help for such systems, but methods proposed in the literature cannot de