A cause-effect chain is used to define the logical order of data dependent tasks, which is
independent from the execution order of the jobs of the (periodic/sporadic) tasks. Analyzing …

Current adaptive mixed criticality scheduling policies assume a high criticality mode in which
all low criticality tasks are descheduled to ensure that high criticality tasks can meet timing …

This paper explores the probability of deadline misses for a set of constrained-deadline
sporadic soft real-time tasks on uniprocessor platforms. We explore two directions to …

Motivated by a string of recent errata, the paper argues that mechanized, yet readable
schedulability proofs are desirable, feasible to create with current tools and with reasonable …

Fixed-priority scheduling has been widely used in safety-critical applications. This paper
explores the parametric utilization bounds for implicit-deadline periodic tasks in automotive …

Cache partitioning is a technique to reduce interference among tasks running on the
processors with shared caches. To make this technique effective, cache segments should be …

To deal with a large variety of workloads in different application domains in real-time
embedded systems, a number of expressive task models have been developed. For each …

In many real-time systems, preemption is either impossible or prohibitively expensive. The
problem of scheduling non-preemptive periodic tasks with known release offsets is known to …

Partitioned multiprocessor scheduling has been widely accepted in academia and industry
to statically assign and partition real-time tasks onto identical multiprocessor systems. This …

In this paper, we take a careful look at speedup factors, utilization bounds, and capacity
augmentation bounds. These three metrics have been widely adopted in real-time …