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

Much of the power of modern Web comes from the ability of a Web page to combine content
and JavaScript code from disparate servers on the same page. While the ability to create …

Prior work has identified several optimal algorithms for scheduling independent, implicit-
deadline sporadic (or periodic) real-time tasks on identical multiprocessors. These …

A large class of embedded systems is distinguished from general-purpose computing
systems by the need to satisfy strict requirements on timing, often under constraints on …

Scheduling latency under Linux and its principal real-time variant, the PREEMPT RT patch,
are typically measured using cyclictest, a tracing tool that treats the kernel as a black box …

We systematically survey the literature on analytically sound multiprocessor real-time
locking protocols from 1988 until the end of 2017, covering the following topics: Progress …

A multiprocessor scheduling algorithm named U-EDF, was presented in [1] for the
scheduling of periodic tasks with implicit deadlines. It was claimed that U-EDF is optimal for …

In this work, we provide an experimental comparison between Global-EDF and Partitioned-
EDF, considering the run-time overhead of a real-time operating system (RTOS). Recent …

This paper presents the first suspension-based multiprocessor real-time locking protocols
with asymptotically optimal blocking bounds (under certain analysis assumptions). These …

When concurrent real-time tasks have to access shared resources, to prevent race
conditions, the synchronization and resource access must ensure mutual exclusion, eg, by …