✦ LIBER ✦

Scheduling aperiodic requests in the presence of hard real-time tasks with linear timing constraints

✍ Scribed by Kavalerov, M. V.; Matushkin, N. N.

Book ID: 121492022
Publisher: Allerton Press, Inc.
Year: 2013
Tongue: English
Weight: 175 KB
Volume: 84
Category: Article
ISSN: 1068-3712
DOI: 10.3103/S1068371213110072

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fault-tolerance through scheduling of ap

Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems

✍ Ghosh, S.; Melhem, R.; Mosse, D. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 507 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

[IEEE 2013 26th International Conference

[IEEE 2013 26th International Conference on VLSI Design: concurrently with the 12th International Conference on Embedded Systems - Pune, India (2013.01.5-2013.01.10)] 2013 26th International Conference on VLSI Design and 2013 12th International Conference on Embedded Systems - Scheduling Aperiodic Tasks in Next Generation Embedded Real-Time Systems

✍ Ahmed, Rehan; Ramanathan, Parameshwaram; Saluja, Kewal K.; Yao, Chunhua 📂 Article 📅 2013 🏛 IEEE ⚖ 943 KB