We propose two server implementations for multiplexing aperiodic and recurrent (i.e., periodic, sporadic, or “rate-based”) real-time tasks in fair-scheduled multiprocessor sys...
Anand Srinivasan, Philip Holman, James H. Anderson
This paper focuses on scheduling different hard real-time applications on a uniprocessor when the earliest deadline first algorithm is used as the local scheduler, and the global ...
(m,k)-firm constraints have been used to schedule tasks in soft/firm real-time systems under overloaded conditions. In general, they are provided by application designers to guara...
After having drawn up a state of the art on the theoretical feasibility of a system of periodic tasks scheduled by a preemptive algorithm at fixed priorities, we show in this art...
In the last years, a progressive migration from single processor chips to multi-core computing devices has taken place in the general-purpose and embedded system market. The devel...