The well-known periodic task model of Liu and Layland 1] assumes a worst-case execution time bound for every task and may be too pessimistic if the worst-case execution time of a ...
The management of tasks is an essential requirement in most real-time and embedded systems, but invariably leads to unwanted CPU overheads. This paper is concerned with task manage...
We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy th...
Nowadays container terminals are struggling with a continuously increasing volume. Therefore, they are searching for solutions to increase throughput capacity without expanding th...
In this paper we present improved techniques for the schedulability analysis of tasks with precedence relations in multiprocessor and distributed systems, scheduled under a preemp...