


default search action
27th RTNS 2019: Toulouse, France
- Jérôme Ermont, Ye-Qiong Song, Christopher D. Gill:

Proceedings of the 27th International Conference on Real-Time Networks and Systems, RTNS 2019, Toulouse, France, November 06-08, 2019. ACM 2019, ISBN 978-1-4503-7223-7
Analysis and validation
- Ishfaq Hussain

, Muhammad Ali Awan
, Pedro F. Souto
, Konstantinos Bletsas
, Benny Akesson, Eduardo Tovar
:
Response time analysis of multiframe mixed-criticality systems. 8-18 - Frédéric Giroudot, Ahlem Mifdaoui:

Tightness and computation assessment of worst-case delay bounds in wormhole networks-on-chip. 19-29 - David Griffin

, James Harbin, Alan Burns, Iain Bate, Robert I. Davis, Leandro Soares Indrusiak:
Validating high level simulation results against experimental data and low level simulation: a case study. 30-40
Fault-tolerance, security, and dataflow
- Kunal Agrawal, Sanjoy K. Baruah, Alan Burns:

Fault-tolerant transmission of messages of differing criticalities across a shared communication medium. 41-49 - Anway Mukherjee, Tanmaya Mishra, Thidapat Chantem

, Nathan Fisher
, Ryan M. Gerdes:
Optimized trusted execution for hard real-time applications on COTS processors. 50-60 - Amaury Graillat, Claire Maiza, Matthieu Moy, Pascal Raymond, Benoît Dupont de Dinechin:

Response time analysis of dataflow applications on a many-core processor with shared-memory and network-on-chip. 61-69
Networking I
- Aakash Soni

, Jean-Luc Scharbarg, Jérôme Ermont
:
Quantum assignment for QoS-aware AFDX network with deficit round robin. 70-79 - Marc Boyer

, Hugo Daigmorte:
Impact on credit freeze before gate closing in CBS and GCL integration into TSN. 80-89 - Jonathan Falk, Frank Dürr, Kurt Rothermel:

Modeling time-triggered service intermittence in network calculus. 90-100 - Anaïs Finzi, Silviu S. Craciunas:

Breaking vs. solving: analysis and routing of real-time networks with cyclic dependencies using network calculus. 101-111
Processor scheduling
- Clara Hobbs

, Zelin Tong, James H. Anderson:
Optimal soft real-time semi-partitioned scheduling made simple (and dynamic). 112-122 - Ashikahmed Bhuiyan, Sai Sruti, Zhishan Guo

, Kecheng Yang
:
Precise scheduling of mixed-criticality tasks by varying processor speed. 123-132 - James Orr, Sanjoy K. Baruah:

Multiprocessor scheduling of elastic tasks. 133-142
Networking II
- Tieu Long Mai, Nicolas Navet, Jörn Migge:

On the use of supervised machine learning for assessing schedulability: application to ethernet TSN. 143-153 - Jonathan Falk, Frank Dürr, Steffen Linsenmayer, Stefan Wildhagen, Ben W. Carabelli, Kurt Rothermel:

Optimal routing and scheduling of complemental flows in converged networks. 154-164 - Akram Hakiri

, Aniruddha Gokhale
, Pascal Berthou
:
Software-defined wireless mesh networking for reliable and real-time smart city cyber physical applications. 165-175 - Adnan Aijaz, Aleksandar Stanoev, Usman Raza:

GALLOP: toward high-performance connectivity for closing control loops over multi-hop wireless networks. 176-186
Synchronization, preemption, and coordination
- Catherine E. Nemitz

, Tanya Amert, Manish Goyal, James H. Anderson:
Concurrency groups: a new way to look at real-time multiprocessor lock nesting. 187-197 - Sanjoy K. Baruah, Nathan Fisher:

Choosing preemption points to minimize typical running times. 198-208 - Joël Goossens, Xavier Poczekajlo, Antonio Paolillo

, Paul Rodríguez:
ACCEPTOR: a model and a protocol for real-time multi-mode applications on reconfigurable heterogeneous platforms. 209-219

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














