![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
31st RTNS 2023: Dortmund, Germany
- Proceedings of the 31st International Conference on Real-Time Networks and Systems, RTNS 2023, Dortmund, Germany, June 7-8, 2023. ACM 2023, ISBN 978-1-4503-9983-8
- Alban Gruin
, Thomas Carle
, Christine Rochange
, Pascal Sainrat
:
Enabling timing predictability in the presence of store buffers. 1-10 - Sandro Grebant
, Clément Ballabriga
, Julien Forget
, Giuseppe Lipari
:
WCET analysis with procedure arguments as parameters. 11-22 - Thilo L. Fischer
, Heiko Falk
:
Analysis of Shared Cache Interference in Multi-Core Systems using Event-Arrival Curves. 23-33 - Javier Pérez-Rodríguez
, Patrick Meumeu Yomsi
, Yilian Ribot González
, Luis Javier Pente Lam
:
B-TSP: An Advanced Power Safe Management Strategy for modern Multi-core Platforms under Thermal-Aware Design. 34-44 - Giovanni Buzzega
, Gianluca Nocetti
, Manuela Montangero
:
Characterizing G-EDF scheduling tardiness with uniform instances on multiprocessors. 45-55 - Abhishek Singh
, Sanjoy K. Baruah
:
Dimensions of fixed-priority aperiodic servers. 56-66 - Sanjoy K. Baruah
:
Improved Uniprocessor Scheduling of Systems of Sporadic Constrained-Deadline Elastic Tasks. 67-75 - Jonas Peeck
, Rolf Ernst
:
Enabling multi-link data transmission for collaborative sensing in open road scenarios. 76-86 - Yilian Ribot González
, Geoffrey Nelissen
, Eduardo Tovar
:
IPDeN 2.0: Real-time NoC with selective flit deflection and buffering. 87-98 - José Mariano Finochietto
, Ousmane Dieng
, Daniel Mossé
, Rodrigo M. Santos
:
Adding Empirical Real-Time Guarantees to LoRaWAN. 99-107 - Lisa Maile
, Dominik Voitlein
, Alexej Grigorjew
, Kai-Steffen Jens Hielscher
, Reinhard German
:
On the Validity of Credit-Based Shaper Delay Guarantees in Decentralized Reservation Protocols. 108-118 - Paraskevas Karachatzis
, Jan Ruh
, Silviu S. Craciunas
:
An Evaluation of Time-triggered Scheduling in the Linux Kernel. 119-131 - Tanmaya Mishra
, Jinwen Wang
, Thidapat Chantem
, Ryan M. Gerdes
, Ning Zhang
:
A Procrastinating Control-Flow Integrity Framework for Periodic Real-Time Systems. 132-142 - Tarek F. Abdelzaher
, Sanjoy K. Baruah
, Iain Bate
, Alan Burns
, Robert Ian Davis
, Yigong Hu
:
Scheduling Classifiers for Real-Time Hazard Perception Considering Functional Uncertainty. 143-154 - Alan Burns
, Sanjoy K. Baruah
:
Multi-Model Specifications and their Application to Classification Systems. 155-165 - Alessandro Druetto
, Enrico Bini
, Andrea Grosso
, Stefano Puri
, Silvio Bacci
, Marco Di Natale
, Francesco Paladino
:
Task and Memory Mapping of Large Size Embedded Applications over NUMA architecture✱. 166-176 - Shuai Zhao
, Xiaotian Dai
, Benjamin Lesage
, Iain Bate
:
Cache-Aware Allocation of Parallel Jobs on Multi-cores based on Learned Recency. 177-187 - Benjamin Lesage
, Xiaotian Dai
, Shuai Zhao
, Iain Bate
:
Reducing Loss of Service for Mixed-Criticality Systems through Cache- and Stress-Aware Scheduling. 188-199 - Binqi Sun
, Tomasz Kloda
, Sergio Arribas García
, Giovani Gracioli
, Marco Caccamo
:
Minimizing Cache Usage for Real-time Systems. 200-211 - Risheng Xu
, Marvin Kühl
, Hermann von Hasseln
, Dirk Nowotka
:
Reducing Overall Path Latency in Automotive Logical Execution Time Scheduling via Reinforcement Learning. 212-223 - Mario Günzel
, Niklas Ueter
, Kuan-Hsun Chen
, Jian-Jia Chen
:
Timing Analysis of Cause-Effect Chains with Heterogeneous Communication Mechanisms. 224-234
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.