Abstract Controller Area Network (CAN) is used extensively in automotive applications, with
in excess of 400 million CAN enabled microcontrollers manufactured each year. In 1994 …

The question whether preemptive algorithms are better than nonpreemptive ones for
scheduling a set of real-time tasks has been debated for a long time in the research …

Efficient exact schedulability tests are required both for on-line admission of applications to
dynamic systems and as an integral part of design tools for complex distributed real-time …

Fixed-priority scheduling with deferred preemption (FPDS) has been proposed in the
literature as a viable alternative to fixed-priority pre-emptive scheduling (FPPS), that …

A central issue for verifying the schedulability of hard real-time systems is the correct
evaluation of task execution times. These values are significantly influenced by the …

The optimality of the Earliest Deadline First scheduler for uniprocessor systems is one of the
main reasons behind the popularity of this algorithm among real-time systems. The ability of …

This paper focuses on priority assignment for realtime systems using fixed priority
scheduling. It introduces and defines the concept of a" robust" priority ordering: the most …

A scheduling policy or a schedulability test is defined to be sustainable if any task system
determined to be schedulable remains so if it behaves" better" than mandated by its system …

Intermittently powered devices (IPDs) have gained much interest in recent years. However,
scheduling real-time tasks while supporting data consistency, timekeeping, and …

The question whether preemptive systems are better than non-preemptive systems has
been debated for a long time, but only partial answers have been provided in the real-time …