Optimal Priority Assignment for Synchronous Harmonic Tasks with Dynamic Self-Suspension

Self-suspension behavior happens when a job has to wait for some activity to complete and results in substantial schedulability degradation in real-time systems. Despite extensive studies for self-suspending real-time task systems, the state of the art has barely addressed the optimality of the scheduling algorithms, especially for tasks with dynamic self-suspension. In this paper, we explore optimal priority assignment for periodic real-time tasks with dynamic self-suspension under Task-level Fixed-Priority (T-FP) scheduling. To that end, we provide exact schedulability tests for frame-based and synchronous harmonic tasks. We show that the Suspension-Aware Deadline-Monotonic (SADM) priority assignment is an optimal fixed-priority scheduler for many scenarios. Further, for cases where SADM is not optimal, we adopt Audsley's Optimal Priority Assignment (OPA) approach to derive an optimal fixedpriority assignment. Evaluation results show that the exact tests outperform state-of-the-art schedulability tests from the literature, and that optimal priority assignments significantly improve schedulability over classical priority assignments.

Authors

Institutions

Publication Details

Published
2025-05-06
DOI
https://doi.org/10.1109/rtas65571.2025.00010
Citations
1
Primary Topic
Iterative Learning Control Systems
Type
article
Field-Weighted Citation Impact
1.21

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal Priority Assignment for Synchronous Harmonic Tasks with Dynamic Self-Suspension

Marion Sudvarg, Max A. Deppert, Mario Günzel, Kuan-Hsun Chen et al.
1 citations
Iterative Learning Control Systems
1.21
article

Optimal Priority Assignment for Synchronous Harmonic Tasks with Dynamic Self-Suspension

Marion Sudvarg, Max A. Deppert, Mario Günzel, Kuan-Hsun Chen, Ao Li, Ning Zhang
article en
1 citations

Abstract

Self-suspension behavior happens when a job has to wait for some activity to complete and results in substantial schedulability degradation in real-time systems. Despite extensive studies for self-suspending real-time task systems, the state of the art has barely addressed the optimality of the scheduling algorithms, especially for tasks with dynamic self-suspension. In this paper, we explore optimal priority assignment for periodic real-time tasks with dynamic self-suspension under Task-level Fixed-Priority (T-FP) scheduling. To that end, we provide exact schedulability tests for frame-based and synchronous harmonic tasks. We show that the Suspension-Aware Deadline-Monotonic (SADM) priority assignment is an optimal fixed-priority scheduler for many scenarios. Further, for cases where SADM is not optimal, we adopt Audsley's Optimal Priority Assignment (OPA) approach to derive an optimal fixedpriority assignment. Evaluation results show that the exact tests outperform state-of-the-art schedulability tests from the literature, and that optimal priority assignments significantly improve schedulability over classical priority assignments.

TU Dortmund University (DE), Washington University in St. Louis (US), Christian-Albrechts-Universität zu Kiel (DE)
National Aeronautics and Space Administration, European Research Council
Openalex Percentile: Top 21%
Iterative Learning Control Systems
1.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.