Joint Task and Flow Scheduling for Time-Triggered and Strict-Priority Networks

Arestova A, Maile L, Halikulov N, Hielscher KS, German R (2023)

Publication Type: Conference contribution

Publication year: 2023

Publisher: IEEE

Series: International Conference on Computing, Networking and Communications (ICNC)

Conference Proceedings Title: 2023 International Conference on Computing, Networking and Communications (ICNC)

Event location: Honolulu, HI US

URI: https://ieeexplore.ieee.org/document/10074288

DOI: 10.1109/ICNC57223.2023.10074288

Abstract

Compliance with the end-to-end latency of tasks and flows is a safety-relevant constraint in real-time systems. Especially when tasks and flows are interconnected by data dependencies in so-called Cause-Effect Chains, the adherence to end-to-end restrictions becomes even more complex. In our previous work, we proposed the incremental algorithm ITANS, which presents a solution for the joint scheduling of tasks and flows organized in Cause-Effect-Chains in communication networks applying the IEEE 802.1Qbv Time-Aware Shaper. In this work, we extend the approach to communication networks using the scheduling method Strict Priority (SP). The determination of the worst-case transmission time (WCTT) of flows is an essential part of ITANS. To derive the WCTT of flows in SP-based networks, we use the mathematical framework Network Calculus (NC) combining existing analyses to derive the least pessimistic delay guarantees for network flows. The evaluations show that the extension of ITANS can achieve a high success rate and a low runtime on average in systems with Gigabit Ethernet and communication networks that use SP.

Authors with CRIS profile

Anna Arestova Computer Science 7 (Computer Networks and Communication Systems) Lisa Maile Computer Science 7 (Computer Networks and Communication Systems) Nurbek Halikulov Computer Science 7 (Computer Networks and Communication Systems) Kai-Steffen Hielscher Computer Science 7 (Computer Networks and Communication Systems) Reinhard German Computer Science 7 (Computer Networks and Communication Systems)

Related research project(s)

Network Calculus for Time-Sensitive Networking (NC for TSN) Oct. 1, 2018 - Oct. 1, 2021

How to cite

APA:

Arestova, A., Maile, L., Halikulov, N., Hielscher, K.-S., & German, R. (2023). Joint Task and Flow Scheduling for Time-Triggered and Strict-Priority Networks. In 2023 International Conference on Computing, Networking and Communications (ICNC). Honolulu, HI, US: IEEE.

MLA:

Arestova, Anna, et al. "Joint Task and Flow Scheduling for Time-Triggered and Strict-Priority Networks." Proceedings of the 2023 International Conference on Computing, Networking and Communications (ICNC), Honolulu, HI IEEE, 2023.

BibTeX: Download