This paper considers the scheduling of parallel real-time tasks with implicit deadlines. Each
parallel task is characterized as a general directed acyclic graph (DAG). We analyze three …

With the widespread adoption of multicore architectures, multiprocessors are now a
standard deployment platform for (soft) real-time applications. This dissertation addresses …

As system integration becomes an increasingly important challenge for complex real-time
systems, there has been a significant demand for supporting real-time systems in virtualized …

A job that is impeded by a preemption or migration incurs additional cache misses when it
resumes execution due to a loss of cache affinity. While often regarded negligible in …

As multicore processors become ever more prevalent, it is important for real-time programs
to take advantage of intra-task parallelism in order to support computation-intensive …

As multicore platforms become ever larger, overhead-related factors play a greater role in
determining which real-time scheduling algorithms are preferable. In this paper, such factors …

Recent years have witnessed two major trends in the development of complex real-time
embedded systems. First, to reduce cost and enhance flexibility, multiple systems are …

Mixed-criticality scheduling algorithms, which attempt to reclaim system capacity lost to worst-
case execution time pessimism, seem to hold great promise for multi core real-time systems …

Semi-partitioned schedulers are--in theory--a particularly promising category of
multiprocessor real-time scheduling algorithms. Unfortunately, issues pertaining to their …

We present a co-designed scheduling framework and platform architecture that together
support compositional scheduling of real-time systems. The architecture is built on the Xen …