Logical Execution Time (LET) allows decoupling the schedule of real-time periodic tasks from their communication, with the advantage of isolating the communication pattern from the variability of the schedule. However, when such tasks are organized in chains, the usage of LET at the task level does not necessarily transfer the same LET properties to the chain level. In this paper, we extend a LET-like model from tasks to chains spanning over multiple cores. We leverage the designed constant latency chains to optimize per-core priority assignment. Finally, we also provide a set of heuristic algorithms, that are compared in a large-scale experimental evaluation.
@InProceedings{paladino_et_al:LIPIcs.ECRTS.2024.6, author = {Paladino, Francesco and Biondi, Alessandro and Bini, Enrico and Pazzaglia, Paolo}, title = {{Optimizing Per-Core Priorities to Minimize End-To-End Latencies}}, booktitle = {36th Euromicro Conference on Real-Time Systems (ECRTS 2024)}, pages = {6:1--6:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-324-9}, ISSN = {1868-8969}, year = {2024}, volume = {298}, editor = {Pellizzoni, Rodolfo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2024.6}, URN = {urn:nbn:de:0030-drops-203094}, doi = {10.4230/LIPIcs.ECRTS.2024.6}, annote = {Keywords: Cause-Effect Chains, Logical Execution Time, End-to-End Latency, Design Optimization, Task Priorities, Data Age, Reaction Time} }
Feedback for Dagstuhl Publishing