This survey covers hard real-time scheduling algorithms and schedulability analysis
techniques for homogeneous multiprocessor systems. It reviews the key results in this field …

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

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 …

Over the last decade, machine learning (ML) and deep learning (DL) algorithms have
significantly evolved and been employed in diverse applications, such as computer vision …

Current hard real-time scheduling and analysis techniques are unable to efficiently utilize
the computational bandwidth provided by multicore platforms. This is due to the large gap …

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 …

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

Ongoing research is discussed on the development of operating-system support for
enabling mixed-criticality workloads to be supported on multicore platforms. This work is …

Current computing architectures are commonly built with multiple cores and a single shared
main memory. Even though this architecture increases the overall computation power, main …

An empirical study of implementation tradeoffs (choice of ready queue implementation,
quantum-driven vs. event-driven scheduling, and interrupt handling strategy) affecting global …