Numerical simulations often play an important role when evaluating and comparing the performance of schedulability tests, as they allow to empirically demonstrate their applicability using synthesized task sets under various configurations. In order to provide a fair comparison of various schedulability tests, von der Brüggen et al. presented the first version of an evaluation framework for self-suspending task sets. In this work-in-progress, we further enhance the framework by providing more features to ease the use, e.g., Python 3 support, an improved GUI, multiprocessing, Gurobi optimization, and external task evaluation. In addition, we integrate the state-of-the-arts we are aware of into the framework. Moreover, the documentation is improved significantly to simplify the application in further research and development. To the best of our knowledge, the framework contains all suspension-aware schedulability tests for uniprocessor systems and we aim to keep it up-to-date.

Evaluation Framework for Self-Suspending Schedulability Tests

In real-time scheduling theory, self-suspension describes the behavior that a job can suspend itself from the ready state and thus be exempted from the scheduling for the suspension duration. This behavior makes it non-trivial to resort to established concepts such as the busy-interval analysis to self-suspending task sets which is required to analyze the worst-case response time of tasks with backlog, e.g., arbitrary-deadline task sets. In this paper, we present a novel suspension-aware busy-interval analysis for dynamic self-suspension tasks where the inter-arrival time of subsequent jobs can be bounded by an arrival curve. Based on the general analysis, we provide worst-case response time analyses and hence sufficient schedulability tests for fixed-priority preemptive uniprocessor scheduling algorithms for arrival-curve constrained and sporadic self-suspension task systems with arbitrary deadlines. Moreover, we provide evaluations based on synthetically generated task sets that show that our method indeed exploits the optimism that is introduced when enlarging the relative deadline of tasks. We demonstrate that our approach improves the state of the art by considering arrival curves that are obtained from tasks with release jitter.

Suspension-Aware Fixed-Priority Schedulability Test with Arbitrary Deadlines And Arrival Curves

Real-time systems increasingly use multicore processors in order to satisfy thermal, power, and computational requirements. To exploit the architectural parallelism offered by the multicore processors, parallel task models, scheduling algorithms and response-time analyses with respect to real-time constraints have to be provided. In this paper, we propose a reservation-based scheduling algorithm for sporadic constrained-deadline parallel conditional DAG tasks with probabilistic execution behaviour for applications that can tolerate bounded number of deadline misses and bounded tardiness. We devise design rules and analyses to guarantee bounded tardiness for a specified bounded probability for k-consecutive deadline misses without enforcing late jobs to be immediately aborted.

Response-Time Analysis and Optimization for Probabilistic Conditional Parallel DAG Tasks

**Session chairs:** Hoon Sung Chwa	and	Federico Terraneo

- 5 min: [**(WaP) Linear-time admission control for elastic scheduling**](https://tu-dortmund.sciebo.de/s/6MZ1StUhCvN00pl), *Marion Sudvarg, Chris Gill and Sanjoy Baruah*
- 5 min: [**(WiP) Automatically Generated Response-Time Proofs as Evidence of Timeliness**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a512/280200a512.pdf), *Marco Maida, Sergey Bozhko and Björn Brandenburg*
- 5 min: [**(WiP) Evaluation Framework for Self-Suspending Schedulability Tests**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a532/280200a532.pdf), *Mario Guenzel, Harun Teper, Kuan-Hsun Chen, Georg von der Brüggen and Jian-Jia Chen*
- 5 min: [**(WiP) Partial-Order Reduction in Reachability-based Response-Time Analyses**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a544/280200a544.pdf), *Sayra Ranjha, Mitra Nasri and Geoffrey Nelissen*
- 5 min: [**(WiP) Run-time pWCET estimation and quality monitoring**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a552/280200a552.pdf), *Federico Reghenzani, Filippo Sciamanna and William Fornaciari*
- 5 min: [**(WiP) Worst-Case Response Time of Intersection Management Protocols**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a556/280200a556.pdf), *Radha Reddy, Luís Almeida, Miguel Gaitan, Harrison Kurunathan, Pedro Santos and Eduardo Tovar*
- 5 min: [**(WiP) Analysis of TSN Time-aware Shapers using Schedule Abstraction Graphs**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a508/280200a508.pdf), *Srinidhi Srinivasan, Geoffrey Nelissen and Reinder J. Bril*
- 5 min: **(RTSS@Work) Demonstrating RA-TDMAs+ for robust communication in WiFi mesh networks**, *Diogo Almeida, Miguel Gutiérrez Gaitán, Pedro M. d'Orey, Pedro M. Santos, Luı́s Pinto and Luı́s Almeida*

2.12 - Brief Presentations and RTSS@Work

technical paper

 **RTSS 2021** has successfully concluded. Hope you have enjoyed it, and look forward to seeing you next year in person.
    Announcement for the Awards:
 * Best Paper Award goes to: Monte Carlo Response-Time Analysis, Sergey Bozhko, Georg von der Brüggen, and Björn Brandenburg
 * Best Student Paper Award goes to: Automatic Energy-Hotspot Detection and Elimination in Real-Time Deeply Embedded Systems, Mohsen Shekarisaz, Lothar Thiele, and Mehdi Kargahi.
 * Best Solution Award for Industry Session goes to: Toward Real-Time Guaranteed Scheduling for Autonomous Driving Systems. Jinghao Sun, Tianyi Wang, Kailu Duan, Bin Lu, Jiankang Ren, Zhishan Guo, and Guozhen Tan.



IEEE RTSS 2021

The IEEE Real-Time Systems Symposium (RTSS) is the premier conference in the field of real-time systems, and is a venue for researchers and practitioners to showcase innovations covering all aspects of real-time systems, including theory, design, analysis, implementation, evaluation, and experience. 

**Session chair:** Paolo Pazzaglia<br><br>

- 25 min: [**Suspension-Aware Fixed-Priority Schedulability Test with Arbitrary Deadlines And Arrival Curves**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a418/280200a418.pdf), *Mario Guenzel, Niklas Ueter and Jian-Jia Chen*
- 25 min: [**(Outstanding Paper) TORTIS: Retry-Free Software Transactional Memory for Real-Time Systems**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a469/280200a469.pdf), *Claire Nord, Shai Caspin, Catherine Nemitz, Howard Shrobe, Hamed Okhravi, Jim Anderson, Nathan Burow and Bryan Ward*
- 25 min: [**Tighter Bounds of Speedup Factor of Partitioned EDF for Constrained-Deadline Sporadic Tasks**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a431/280200a431.pdf), *Xingwu Liu, Zizhao Chen, xin han, Zhenyu Sun and Zhishan Guo*
- 25 min: [**Heterogeneous Quasi-Partitioned Scheduling**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a266/280200a266.pdf), *Ernesto Massa, George Lima, Bjorn Andersson and Vinicius Petrucci*



2.13 - Scheduling II

 **Session chair:** Steffen Bondorf <br><br>

- 25 min: [**Response-Time Analysis and Optimization for Probabilistic Conditional Parallel DAG Tasks**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a380/280200a380.pdf), *Niklas Ueter, Mario Guenzel and Jian-Jia Chen*
- 25 min: [**A ROS 2 Response-Time Analysis Exploiting Starvation Freedom and Execution-Time Variance (Artifact Evaluated)**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a041/280200a041.pdf), *Tobias Blass, Daniel Casini, Sergey Bozhko and Björn Brandenburg*
- 25 min: [**Addressing Multi-Core Timing Interference using Co-Runner Locking**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a054/280200a054.pdf), *Hyoseung Kim, Dionisio de Niz, Bjorn Andersson, Mark Klein and John Lehoczky*
- 25 min: [**(Outstanding Paper) Monte Carlo Response-Time Analysis**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a342/280200a342.pdf), *Sergey Bozhko, Georg von der Brüggen and Björn Brandenburg*




Mario Günzel

3

3

SHORT BIO

Presentations

Evaluation Framework for Self-Suspending Schedulability Tests

Suspension-Aware Fixed-Priority Schedulability Test with Arbitrary Deadlines And Arrival Curves

Response-Time Analysis and Optimization for Probabilistic Conditional Parallel DAG Tasks

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES