Global scheduling reduces the average response times as it can use the available
computing cores more efficiently for scheduling ready tasks. However, this flexibility poses …

Most recurrent real-time applications can be modeled as a set of sequential code segments
(or blocks) that must be (repeatedly) executed in a specific order. In this paper, we provide a …

Gang scheduling has long been adopted by the high-performance computing community as
a way to reduce the synchronization overhead between related threads. It allows for several …

Schedule randomization is one of the recently introduced security defenses against
schedule-based attacks, ie, attacks whose success depends on a particular ordering …

Abstract IEEE Time-Sensitive Networking (TSN) is one of the main solutions considered by
the industry to support time-sensitive communication in data-intensive safety-critical and …

The temporal correctness of safety-critical systems is typically guaranteed via a response-
time analysis (RTA). However, as systems become complex (eg, parallel tasks running on a …

Exact schedulability analysis of limited-preemptive (or non-preemptive) real-time workloads
with variable execution costs and release jitter is a notoriously difficult challenge due to the …

In an embedded real-time system (ERTS), real-time tasks (software) are typically executed
on a multicore shared-memory platform (hardware). The number of cores is usually small …

Safety and control functions of modern automotive systems are implemented as chains of
periodic data producer/consumer tasks run at different rates. To simplify the development of …

Real-time gang task scheduling has received much recent attention due to the emerging
trend of applying highly parallel accelerators (eg, GPU) and parallel programming models …