✦ LIBER ✦

Schedulability analysis of fixed-priority systems using timed automata

✍ Scribed by Elena Fersman; Leonid Mokrushin; Paul Pettersson; Wang Yi

Book ID: 108281149
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 672 KB
Volume: 354
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.11.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fixed-priority scheduling of real-time s

Fixed-priority scheduling of real-time systems using utilization bounds

✍ Dong-Won Park; Swaminathan Natarajan; Arkady Kanevsky 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 812 KB

An Analysis of Fixed-Priority Schedulabi

An Analysis of Fixed-Priority Schedulability on a Multiprocessor

✍ Theodore P. Baker 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 901 KB

Analysis of Scheduling Behaviour using G

Analysis of Scheduling Behaviour using Generic Timed Automata

✍ Thorsten Gerdsmeier; Rachel Cardell-Oliver 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 147 KB

Sensitivity analysis for fixed-priority

Sensitivity analysis for fixed-priority real-time systems

✍ Enrico Bini; Marco Di Natale; Giorgio Buttazzo 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 668 KB

Predictability of Fixed-Job Priority sch

Predictability of Fixed-Job Priority schedulers on heterogeneous multiprocessor real-time systems

✍ Liliana Cucu-Grosjean; Joël Goossens 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 141 KB

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