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 …

Real-time scheduling algorithms for multiprocessor systems have been the subject of
considerable recent interest. For such an algorithm to be truly useful in practice, support for …

Chip-multiprocessors represent a dominant new shift in the field of processor design. Better
utilization of such technology in the real-time context requires coordinated approaches to …

When locking protocols are used in real-time systems, bounds on blocking times are
required when ensuring timing constraints. While the term “blocking” is well-understood in …

In the domain of multiprocessor real-time systems, there has been a wealth of recent work
on scheduling, but relatively little work on the equally-important topic of synchronization …

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 …

This paper discusses challenges in computer systems research posed by the emerging
autonomous driving systems. We first identify four research areas related to autonomous …

Several suspension-based multiprocessor real-time locking protocols for partitioned fixed-
priority (P-FP) scheduling have been proposed in prior work. These protocols differ in key …

Multi-core processors have become widespread computing engines for recent embedded
real-time systems. Efficient task partitioning plays a significant role in real-time computing for …