Issue
DARTS, Volume 12, Issue 2
Special Issue of the 38th European Conference on Real-Time Systems (ECRTS 2026)
-
Part of:
Volume:
DARTS, Volume 12 (ECRTS 2026)
Journal: Dagstuhl Artifacts Series (DARTS)
Editors
Publication Details
- published at: 2026-07-02
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Access Numbers
- Detailed Access Statistics available here
-
Total Accesses (updated on a weekly basis)
0Documents
Documents
No documents found matching your filter selection.
Document
Front Matter
Front Matter, Table of Contents, Preface, Conference Organization
Abstract
Front Matter, Table of Contents, Preface, Conference Organization
Cite as
Special Issue of the 38th European Conference on Real-Time Systems (ECRTS 2026). Dagstuhl Artifacts Series (DARTS), Volume 12, Issue 2, pp. 0:i-0:xii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@Article{ward_et_al:DARTS.12.2.0,
author = {Ward, Bryan C. and Aromolo, Federico},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
pages = {0:i--0:xii},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2026},
volume = {12},
number = {2},
editor = {Ward, Bryan C. and Aromolo, Federico},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.12.2.0},
URN = {urn:nbn:de:0030-drops-268741},
doi = {10.4230/DARTS.12.2.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
Artifact
PREEMPT-FaaS: Taming Orchestration Times in Latency-Sensitive Serverless Environments (Artifact)
Abstract
The orchestration of application instances is critical for the efficient management of cloud computing platforms. Specifically, the serverless paradigm automates container spawning and de-spawning based on actual load, mitigating inefficiencies, such as over- and under-provisioning, that might compromise Service Level Objectives (SLOs). This dynamic behavior introduces significant challenges concerning initialization and termination latencies, which are exacerbated when enforcing real-time requirements in mixed-criticality systems. The existing literature already addresses key issues, such as reducing cold-start times and assuring real-time performance to deployed instances. However, container orchestration times remain an overlooked factor that can severely affect instance startup times, especially when the orchestrator is subject to intense workloads. In this paper, we present PREEMPT-FaaS, an orchestration controller that, unlike commonly adopted controllers, adopts a fixed-priority preemptive scheduling of requests to guarantee reduced orchestration times to high-priority and highly critical instances. We implemented PREEMPT-FaaS as a Rust custom controller for Kubernetes (K8s), along with a patch for Knative, a popular serverless platform built upon K8s. We perform an extensive experimental campaign of PREEMPT-FaaS, including the serving of AI workloads, such as, recurring neural networks and video analytics, showing up to ∼6× reduction of orchestration times under high load and improving end-to-end cold-start times of critical instances, with a consequent reduction of service-level laencies (up to ∼2 s reduction under stress at the 95th percentile).
Cite as
Marcello Cinque, Luigi De Simone, Raffaele Della Corte, and Stefano Toscano. PREEMPT-FaaS: Taming Orchestration Times in Latency-Sensitive Serverless Environments (Artifact). In Special Issue of the 38th European Conference on Real-Time Systems (ECRTS 2026). Dagstuhl Artifacts Series (DARTS), Volume 12, Issue 2, pp. 1:1-1:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@Article{cinque_et_al:DARTS.12.2.1,
author = {Cinque, Marcello and De Simone, Luigi and Della Corte, Raffaele and Toscano, Stefano},
title = {{PREEMPT-FaaS: Taming Orchestration Times in Latency-Sensitive Serverless Environments (Artifact)}},
pages = {1:1--1:21},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2026},
volume = {12},
number = {2},
editor = {Cinque, Marcello and De Simone, Luigi and Della Corte, Raffaele and Toscano, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.12.2.1},
URN = {urn:nbn:de:0030-drops-266185},
doi = {10.4230/DARTS.12.2.1},
annote = {Keywords: Edge-Cloud, Orchestration, Containers, Mixed-Criticality, Kubernetes}
}
Document
Artifact
HyperSSE: Cross-Domain Static Analysis of Partitioned Real-Time Hypervisor Systems (Artifact)
Abstract
Timing analysis for embedded real-time systems is crucial to guarantee the correct behavior and to calculate the Worst-Case Response Time (WCRT) of safety-critical applications. With the increasing requirements of such systems in automotive, industrial or avionic industries, consolidation of multiple real-time and general-purpose operating systems on a single high-performance Multiprocessor System-on-Chip (MPSoC) platform using Static Partitioning Hypervisors (SPHs) is becoming more prevalent. Although the strong separation is well suited to reduce interference between isolated domains in such mixed-criticality systems, cross-domain interactions must still be considered in real-time analysis. Previous work has focused on dynamic monitoring and enforcement of timing constraints in virtualized environments.
In this paper, we present HyperSSE, the first approach for the static analysis of cross-domain interactions in hypervisor-based real-time systems. By hierarchically combining existing domain-local static analyses, and synchronizing the control flow at cross-domain interactions, we enable control-flow-sensitive whole-platform analysis including multiple real-time domains. Using abstract task models, this approach can integrate a coarser analysis of general-purpose operating systems, accelerators, and coprocessors with the precise timing analysis. We demonstrate the applicability of HyperSSE in an automotive case study with mixed-criticality software stacks running on Xen in a static partitioning configuration. The resulting Hypervisor State Transition Graph (HSTG) exposes deep knowledge about the platform interactions, enabling cross-domain timing analysis with reduction of pessimistic WCRT calculations. Additionally, HyperSSE can be used for placement optimizations for better predictability, verification of critical interaction paths, and is the foundation for further platform-level analyses, such as analysis of implicit interactions through transparent resource sharing.
Cite as
Andreas Kässens, Mareike Burg, and Daniel Lohmann. HyperSSE: Cross-Domain Static Analysis of Partitioned Real-Time Hypervisor Systems (Artifact). In Special Issue of the 38th European Conference on Real-Time Systems (ECRTS 2026). Dagstuhl Artifacts Series (DARTS), Volume 12, Issue 2, pp. 2:1-2:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@Article{kassens_et_al:DARTS.12.2.2,
author = {K\"{a}ssens, Andreas and Burg, Mareike and Lohmann, Daniel},
title = {{HyperSSE: Cross-Domain Static Analysis of Partitioned Real-Time Hypervisor Systems (Artifact)}},
pages = {2:1--2:3},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2026},
volume = {12},
number = {2},
editor = {K\"{a}ssens, Andreas and Burg, Mareike and Lohmann, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.12.2.2},
URN = {urn:nbn:de:0030-drops-266199},
doi = {10.4230/DARTS.12.2.2},
annote = {Keywords: Static Analysis, Hypervisor, Real-Time Operating System, Cross-Domain}
}
Document
Artifact
BRUMM: A Case for Predictable Memory Reclamation (Artifact)
Abstract
This artifact contains all source code material that has been created for the paper: "BRUMM: A Case for Predictable Memory Reclamation". BRUMM is a mechanism for accounting for the predicted reclamation latency of user-space memory mappings. It enables the system operator to limit reclamation latency via configurable, per-process-group budgets. A prototype of BRUMM has been implemented in the L4Re microkernel-based operating system. The artifact includes the modified L4Re sources, the benchmark programs, and the evaluation scripts for generating plots. This artifact description provides details about the artifact and how to get started reproducing the paper’s results.
Cite as
Viktor Reusch, Michael Roitzsch, and Horst Schirmeier. BRUMM: A Case for Predictable Memory Reclamation (Artifact). In Special Issue of the 38th European Conference on Real-Time Systems (ECRTS 2026). Dagstuhl Artifacts Series (DARTS), Volume 12, Issue 2, pp. 3:1-3:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@Article{reusch_et_al:DARTS.12.2.3,
author = {Reusch, Viktor and Roitzsch, Michael and Schirmeier, Horst},
title = {{BRUMM: A Case for Predictable Memory Reclamation (Artifact)}},
pages = {3:1--3:3},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2026},
volume = {12},
number = {2},
editor = {Reusch, Viktor and Roitzsch, Michael and Schirmeier, Horst},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.12.2.3},
URN = {urn:nbn:de:0030-drops-266202},
doi = {10.4230/DARTS.12.2.3},
annote = {Keywords: Resource Reclamation, Main Memory, Accounting, Operating System, Microkernel, Capability, L4Re}
}
Document
Artifact
DySM: Dynamic Scaling of GPU Streaming Multiprocessor in Spatially Shared Real-Time Embedded GPU Systems (Artifact)
Abstract
Many of today’s real-time embedded systems are increasingly relying on GPUs for AI-related computing. However, existing GPU scheduling solutions for spatially shared GPU systems are still mostly open-loop and rely on worst-case execution time (WCET) estimation for offline schedulability analysis, which cannot adapt to online workload variations. Although adaptive scheduling has been proposed to handle runtime execution time variations, prior approaches target either CPU or time-slicing GPUs, where only one task can execute on the GPU within a time slice. In contrast, spatial sharing enables concurrent kernel execution via Streaming Multiprocessor (SM) partitioning, allowing better GPU resource utilization. Therefore, new adaptive solutions must be designed for spatially shared GPU systems.
In this paper, we propose DySM, a closed-loop response time control algorithm for spatially shared GPUs in soft real-time systems. In face of runtime workload variations, DySM leverages dynamic SM scaling to control task response times with low runtime overhead. To model GPU resource contention among tasks, we analytically derive a multi-input-multi-output (MIMO) system model that captures the impact of SM scaling on the response times of different tasks. Based on this model, DySM is designed using feedback control theory for guaranteed system stability and control accuracy. Experimental results on an Nvidia GPU testbed demonstrate that DySM outperforms state-of-the-art solutions by providing runtime real-time guarantees. Compared to the best-performing baseline, DySM can reduce the deadline miss ratio by up to 90.93%.
Cite as
Srinivasan Subramaniyan and Xiaorui Wang. DySM: Dynamic Scaling of GPU Streaming Multiprocessor in Spatially Shared Real-Time Embedded GPU Systems (Artifact). In Special Issue of the 38th European Conference on Real-Time Systems (ECRTS 2026). Dagstuhl Artifacts Series (DARTS), Volume 12, Issue 2, pp. 4:1-4:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@Article{subramaniyan_et_al:DARTS.12.2.4,
author = {Subramaniyan, Srinivasan and Wang, Xiaorui},
title = {{DySM: Dynamic Scaling of GPU Streaming Multiprocessor in Spatially Shared Real-Time Embedded GPU Systems (Artifact)}},
pages = {4:1--4:3},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2026},
volume = {12},
number = {2},
editor = {Subramaniyan, Srinivasan and Wang, Xiaorui},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.12.2.4},
URN = {urn:nbn:de:0030-drops-266218},
doi = {10.4230/DARTS.12.2.4},
annote = {Keywords: Real-time systems, GPU scheduling, response time ratio control, SM scaling, and feedback control}
}
Document
Artifact
Controlling Adaptive HARQ Erasure Coding for Real-Time Transport under Channel Model Mismatch (Artifact)
Abstract
This artifact contains the source code of the PRRT protocol implementation, and evaluation scripts in the form of Jupyter notebooks to reproduce Figure 2, Figure 3, Figure 4, and Table 2 presented in the paper. The evaluation is split into two parts: evaluating the PRRT network protocol operating over a lossy loopback device (using Linux traffic control), and evaluating the performance aspects of the incremental search in isolation. The artifact contains two repositories, the PRRT protocol implementation, and the evaluation scripts.
Running the complete suite of experiments to reproduce all paper results takes approximately 1 hour on the specified hardware.
The evaluation is sensitive to the real-time capabilities of the underlying operating system. To faithfully reproduce the results of the paper, we recommend using the existing real-time capabilities of modern Linux kernels, and provide a Docker image to ease the installation process compared to the native setup. We also provide the OVA for cross-platform evaluation purposes, it allows to functionally reproduce the results, but may produce degraded results depending on the host and hypervisor real-time capabilities.
Cite as
Moritz Miodek, Marlene Böhmer, and Thorsten Herfet. Controlling Adaptive HARQ Erasure Coding for Real-Time Transport under Channel Model Mismatch (Artifact). In Special Issue of the 38th European Conference on Real-Time Systems (ECRTS 2026). Dagstuhl Artifacts Series (DARTS), Volume 12, Issue 2, pp. 5:1-5:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@Article{miodek_et_al:DARTS.12.2.5,
author = {Miodek, Moritz and B\"{o}hmer, Marlene and Herfet, Thorsten},
title = {{Controlling Adaptive HARQ Erasure Coding for Real-Time Transport under Channel Model Mismatch (Artifact)}},
pages = {5:1--5:4},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2026},
volume = {12},
number = {2},
editor = {Miodek, Moritz and B\"{o}hmer, Marlene and Herfet, Thorsten},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.12.2.5},
URN = {urn:nbn:de:0030-drops-266220},
doi = {10.4230/DARTS.12.2.5},
annote = {Keywords: Transport protocol, Real-time systems, Real-time communication, Linux, Rust, Network reliability, adaptive erasure coding, HARQ, closed-loop control, anytime search, model mismatch}
}
Document
Artifact
Nancy-Playground: A Console Calculator for Deterministic Network Calculus (Artifact)
Abstract
nancy-playground is an open-source, cross-platform command-line tool for Deterministic Network Calculus (DNC) computations. It implements the MPPG scripting syntax used by RTaW’s min-plus playground https://www.realtimeatwork.com/minplus-playground, executing computations via the Nancy [Raffaele Zippo and Giovanni Stea, 2022] and Nancy.Expressions [Trasacco et al., 2024] libraries and their state-of-the-art algorithmic optimizations. It also supports converting MPPG scripts to C# code and an interactive console mode. This artifact provides the source code of nancy-playground (version 1.0.8), example scripts corresponding to the listings of the companion paper, and scripts to reproduce the test and coverage results (Table 7) and the performance measurements (Table 6) of [Raffaele Zippo and Giovanni Stea, 2026].
Cite as
Raffaele Zippo and Giovanni Stea. Nancy-Playground: A Console Calculator for Deterministic Network Calculus (Artifact). In Special Issue of the 38th European Conference on Real-Time Systems (ECRTS 2026). Dagstuhl Artifacts Series (DARTS), Volume 12, Issue 2, pp. 6:1-6:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@Article{zippo_et_al:DARTS.12.2.6,
author = {Zippo, Raffaele and Stea, Giovanni},
title = {{Nancy-Playground: A Console Calculator for Deterministic Network Calculus (Artifact)}},
pages = {6:1--6:5},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2026},
volume = {12},
number = {2},
editor = {Zippo, Raffaele and Stea, Giovanni},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.12.2.6},
URN = {urn:nbn:de:0030-drops-266231},
doi = {10.4230/DARTS.12.2.6},
annote = {Keywords: Deterministic Network Calculus, min-plus algebra, tooling}
}
Document
Artifact
CacheFlow: Using Maximum Flow to Bound Cache-Based Preemption Delays (Artifact)
Abstract
This artifact accompanies the ECRTS 2026 paper CacheFlow: Using Maximum Flow to Bound Cache-Based Preemption Delays [Tiancheng He and Bryan C. Ward, 2026]. It provides the Rust plus Python implementation of every cache-related preemption delay (CRPD) analysis evaluated in the paper, the experiment harness used to compare them, the configurations that drive each figure in the paper, and a Docker-based build that fully reproduces the experimental claims of Sections 7.2-7.4. We claim all four ECRTS artifact-evaluation badges: Available, Functional, Reusable, and Results Reproduced.
Cite as
Tiancheng He and Bryan C. Ward. CacheFlow: Using Maximum Flow to Bound Cache-Based Preemption Delays (Artifact). In Special Issue of the 38th European Conference on Real-Time Systems (ECRTS 2026). Dagstuhl Artifacts Series (DARTS), Volume 12, Issue 2, pp. 7:1-7:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@Article{he_et_al:DARTS.12.2.7,
author = {He, Tiancheng and Ward, Bryan C.},
title = {{CacheFlow: Using Maximum Flow to Bound Cache-Based Preemption Delays (Artifact)}},
pages = {7:1--7:5},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2026},
volume = {12},
number = {2},
editor = {He, Tiancheng and Ward, Bryan C.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.12.2.7},
URN = {urn:nbn:de:0030-drops-266240},
doi = {10.4230/DARTS.12.2.7},
annote = {Keywords: Cache-related preemption delay; CRPD; max-flow; schedulability analysis; real-time systems; artifact}
}
Document
Artifact
DART: A Real-Time Address-Randomization Defense with Predictable Timing (Artifact)
Abstract
This artifact accompanies the ECRTS 2026 paper on DART, a real-time address-randomization defense that randomizes the placement of basic blocks in the virtual address space at page-level granularity while preserving the cache-line behavior of the original binary, thereby keeping a binary’s instruction-cache timing analyzable across all valid randomizations. The artifact contains the full DART toolchain (a patched clang/LLVM 9 compiler, a modified gold linker, the prander randomizer, and a post-link ELF rewriter), distributed as a patch over the upstream Compiler-assisted Code Randomization (CCR) framework. It further contains a patched Linux 5.4.0 kernel whose loader honors DART’s color-aware program headers, the TACLeBench-derived benchmark sources used in the paper, and the experiment drivers and plotting scripts that produce the timing results reported in Section 5 of the companion paper. All components are publicly released so that the community can inspect, reuse, and extend the implementation underlying the paper’s claims.
Cite as
Patrick Dobranowski, Owen Rice, Ryan Burrow, Nathan Burow, and Bryan C. Ward. DART: A Real-Time Address-Randomization Defense with Predictable Timing (Artifact). In Special Issue of the 38th European Conference on Real-Time Systems (ECRTS 2026). Dagstuhl Artifacts Series (DARTS), Volume 12, Issue 2, pp. 8:1-8:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@Article{dobranowski_et_al:DARTS.12.2.8,
author = {Dobranowski, Patrick and Rice, Owen and Burrow, Ryan and Burow, Nathan and Ward, Bryan C.},
title = {{DART: A Real-Time Address-Randomization Defense with Predictable Timing (Artifact)}},
pages = {8:1--8:4},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2026},
volume = {12},
number = {2},
editor = {Dobranowski, Patrick and Rice, Owen and Burrow, Ryan and Burow, Nathan and Ward, Bryan C.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.12.2.8},
URN = {urn:nbn:de:0030-drops-266252},
doi = {10.4230/DARTS.12.2.8},
annote = {Keywords: real-time systems, code randomization, ASLR, WCET, cache analysis, software diversity}
}
Document
Artifact
Uncertainty-Aware Resource Allocation for Multi-Path Programs with In-Kernel Predictions (Artifact)
Abstract
This artifact accompanies the paper Uncertainty-Aware Resource Allocation for Multi-Path Programs with In-Kernel Predictions appearing in ECRTS 2026. It is distributed as a Docker image and provides the scripts and datasets needed to reproduce the paper’s core empirical results across six SPEC CPU 2017 benchmarks. The artifact trains and evaluates gradient boosting regression trees (GBRT) that predict two fine-grained execution properties of each benchmark (remaining execution time and next-window instruction rate) under different resource allocations, exports each model to a compact Q16.16 fixed-point binary, evaluates the speed, accuracy, and size of the models using a fixed-point C inference library, and applies weighted conformal prediction (WCP) to produce high-probability upper bounds on the prediction errors under different operating scenarios. The in-kernel decision logic, which implements MPORA: Multi-Path Online Resource Allocation, is included as source for inspection only, as it requires a custom kernel and specialized hardware to run.
Cite as
Abigail Eisenklam, Carlos A. Montenegro G., Xian Wang, Yifan Cai, Robert Gifford, Linh Thi Xuan Phan, and Ricardo G. Sanfelice. Uncertainty-Aware Resource Allocation for Multi-Path Programs with In-Kernel Predictions (Artifact). In Special Issue of the 38th European Conference on Real-Time Systems (ECRTS 2026). Dagstuhl Artifacts Series (DARTS), Volume 12, Issue 2, pp. 9:1-9:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@Article{eisenklam_et_al:DARTS.12.2.9,
author = {Eisenklam, Abigail and Montenegro G., Carlos A. and Wang, Xian and Cai, Yifan and Gifford, Robert and Phan, Linh Thi Xuan and Sanfelice, Ricardo G.},
title = {{Uncertainty-Aware Resource Allocation for Multi-Path Programs with In-Kernel Predictions (Artifact)}},
pages = {9:1--9:4},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2026},
volume = {12},
number = {2},
editor = {Eisenklam, Abigail and Montenegro G., Carlos A. and Wang, Xian and Cai, Yifan and Gifford, Robert and Phan, Linh Thi Xuan and Sanfelice, Ricardo G.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.12.2.9},
URN = {urn:nbn:de:0030-drops-266261},
doi = {10.4230/DARTS.12.2.9},
annote = {Keywords: multicore, resource allocation, optimal control, learning, multi-path programs}
}
Document
Artifact
Boost-At-The-Tail: Work-Triggered Frequency Boosting for Fixed-Priority Scheduling (Artifact)
Abstract
Fixed-priority (FP) scheduling is widely used in safety-critical real-time systems due to its simplicity and analyzability, yet it may fail to schedule task sets whose worst-case response-time bounds exceed deadlines by small margins. Meanwhile, modern processors increasingly support short-term frequency boosting, providing additional processing capacity subject to thermal and power constraints. This paper introduces Boosted-FP, a fixed-priority scheduling framework that augments a given FP policy with controlled, limited frequency boosting. The key idea is to activate boosting based on the worst-case remaining execution demand of the currently executing job, thereby confining high-frequency execution to the tail of jobs. Per-task boost parameters are computed offline using standard fixed-priority response-time analysis under the chosen priority assignment, while boost activation decisions are made online using worst-case remaining-work information. We show that Boosted-FP preserves hard real-time guarantees by relating its execution behavior to that of a task set with reduced execution times. Leveraging the sustainability of fixed-priority schedulability analysis with respect to execution-time reductions, we establish that any task set schedulable under the modified execution bounds is also schedulable under the proposed framework. We evaluate the framework under a global boost-budget constraint and show experimentally that boost usage remains bounded and often well below the offline provisioned budget. Together, these results demonstrate that controlled, work-triggered boosting can safely extend the schedulable region of fixed-priority scheduling without abandoning static priorities.
Cite as
Behnam Khodabandeloo, Chengzi Huang, and Pontus Ekberg. Boost-At-The-Tail: Work-Triggered Frequency Boosting for Fixed-Priority Scheduling (Artifact). In Special Issue of the 38th European Conference on Real-Time Systems (ECRTS 2026). Dagstuhl Artifacts Series (DARTS), Volume 12, Issue 2, pp. 10:1-10:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@Article{khodabandeloo_et_al:DARTS.12.2.10,
author = {Khodabandeloo, Behnam and Huang, Chengzi and Ekberg, Pontus},
title = {{Boost-At-The-Tail: Work-Triggered Frequency Boosting for Fixed-Priority Scheduling (Artifact)}},
pages = {10:1--10:2},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2026},
volume = {12},
number = {2},
editor = {Khodabandeloo, Behnam and Huang, Chengzi and Ekberg, Pontus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.12.2.10},
URN = {urn:nbn:de:0030-drops-266273},
doi = {10.4230/DARTS.12.2.10},
annote = {Keywords: Fixed Priority Scheduling, Boost frequency, Execution slack}
}
Document
Artifact
Probabilistic Schedulability Analysis for Mixed-Criticality DAG Tasks on Multiprocessors (Artifact)
Abstract
This artifact accompanies the ECRTS 2026 paper "Probabilistic Schedulability Analysis for Mixed-Criticality DAG Tasks on Multiprocessors". The package provides the implementation of the proposed probabilistic schedulability analysis and baseline analyses, together with the DAG-generation wrapper, experiment drivers, plotting scripts, and input data needed to reproduce the main evaluation results of the paper. The primary reproduction workflow covers the paper-scale experiments for Figures 3-5, while additional check and smoke modes provide faster functional validation. The artifact was evaluated in the ECRTS 2026 Artifact Evaluation process and received all four artifact-evaluation seals: Artifact Available, Artifact Evaluated - Functional, Artifact Evaluated - Reusable, and Artifact Evaluated - Results Reproduced.
Cite as
Hiroto Takahashi, Atsushi Yano, and Takuya Azumi. Probabilistic Schedulability Analysis for Mixed-Criticality DAG Tasks on Multiprocessors (Artifact). In Special Issue of the 38th European Conference on Real-Time Systems (ECRTS 2026). Dagstuhl Artifacts Series (DARTS), Volume 12, Issue 2, pp. 11:1-11:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@Article{takahashi_et_al:DARTS.12.2.11,
author = {Takahashi, Hiroto and Yano, Atsushi and Azumi, Takuya},
title = {{Probabilistic Schedulability Analysis for Mixed-Criticality DAG Tasks on Multiprocessors (Artifact)}},
pages = {11:1--11:3},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2026},
volume = {12},
number = {2},
editor = {Takahashi, Hiroto and Yano, Atsushi and Azumi, Takuya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.12.2.11},
URN = {urn:nbn:de:0030-drops-266280},
doi = {10.4230/DARTS.12.2.11},
annote = {Keywords: Mixed-Criticality Systems, DAG Tasks, Probabilistic Analysis, Federated Scheduling, Real-Time Systems, Artifact Evaluation}
}