Skip to content
Conference

Probabilistic Schedulability Analysis for Mixed-Criticality DAG Tasks on Multiprocessors

2026 · Euromicro Conference on Real-Time Systems · Vol 12, pp. 11:1-11:3 · 0 citations · 20 references
Computer Science

TL;DR

A probabilistic schedulability analysis that exploits the statistical rarity of multiple vertices within a DAG exceeding their expected execution budgets by grouping vertices within each DAG into small clusters and bounding the probability that more than one vertex in a cluster overruns.

View source

Similar papers

Conference 2026

Critical-Section Granularity for Multi-Resource Systems with Nested Critical Sections

This paper presents an optimal approach for multi-resource systems that allow any given task to use up to two resources, including support for nested critical sections, achieved by extending analysis to multiple resources and constructing a Quadratically-Constrained Integer Program to determine critical sections.

Catherine E. Nemitz, Tanya Amert, Jonad Pulaj · 0 citations
Preprint Jun 2026

RunSoC 2.0: Scheduling and Allocating Automotive Software Tasks to Hardware Partitions in Heterogeneous MPSoCs

Centralized automotive architectures increasingly consolidate compute-intensive workloads onto heterogeneous Multi-Processor System-on-Chip (MPSoC), creating strict execution, memory, and communication constraints. This paper presents RunSoC 2.0, a customizable framework for early-stage design-space exploration of task...

D. Krüger, Lucas Mauser, Stefan Wagner · 0 citations
Open access Aug 2026

Retention-Based Energy-Efficient and High-Core-Utilization Scheduling for Arbitrary-Deadline DAGs

A retention-oriented scheduling framework for always-on arbitrary-deadline Directed Acyclic Graph workloads, consisting of two algorithms with a clear progression, and shows that, compared with a representative work-conserving baseline with automatic retention/PG, PREHS reduces static energy consumption.

Xiangzhen Xiao, Weijie Wang, Wei-Chen Liu et al. · 0 citations
Conference 2026

CacheFlow: Using Maximum Flow to Bound Cache-Based Preemption Delays

CacheFlow is presented, a framework that formulates total CRPD as a maximum-flow problem, and an iterative max-flow formulation is described to more efficiently integrate the max-flow solving in the context of standard fixed-priority response-time analysis.

Tiancheng He, Bryan C. Ward · 0 citations
2026

Bridging Stochastic Interference and Deterministic Scheduling: An Automated Design Framework for Heterogeneous Embedded Systems

The automated design of heterogeneous embedded systems faces a fundamental challenge: bridging the gap between stochastic latency induced by resource contention and the deterministic requirements of real-time constraints. To address this, we propose a Hybrid Stochastic-Deterministic Modeling framework for contention-aw...

Shao Deng, Shanzhu Xiao, Huamin Tao et al. · 0 citations
Open access 2026

Adaptive Spotted Hyena Optimizer for Latency-Aware Task Scheduling in Heterogeneous Multicore Systems

The Latency-Aware Adaptive Spotted Hyena Optimizer (LA-ASHO) is proposed, a novel metaheuristic scheduling framework grounded in the social hunting behaviour of spotted hyenas that achieves statistically significant reductions in workflow completion latency relative to established baseline schedulers such as; Min-Min,...

Igiri C. G, Ejekwu Obunezi, Ujah Alechenu Israel · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.