You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.
The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.
For the reports in this repository we specifically note that
- the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
- the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
- technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
- in other cases, please contact the copyright owner for detailed information
By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.
If you are in doubt, feel free to contact webmaster@ide.mdh.se
Period-Aware Segmented Synthesis of Schedules for Multi-Hop Time-Triggered Networks
Publication Type:
Conference/Workshop Paper
Venue:
The 22th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Abstract
Time-triggered offline scheduling is a cost-efficient
way to guarantee low communication end-to-end latency and
minimal jitter for communication networks in real-time systems.
The schedule is generated pre-runtime and indicates the transmission
times of time-triggered frames such that contention is
prevented. The synthesis of such offline schedules is a bin-packing
problem, known to be NP-complete, with complexity driven by the
constraints on frame transmissions, and the number of frames
in the schedule. Satisfiability Modulo Theories combined with
segmented approaches have been successfully used for synthesizing
schedules of large networks. However, such synthesis did not
take into account frames periods that are much shorter than the
time to execute the schedule cycle. This paper presents a periodaware
segmented approach that takes into account the frame
periods in order to allocate various instances of a frame within a
single cycle. We describe three different synthesis strategies and
evaluate them with different synthetic experiments. The results
show better performance for one of the strategies, which can
synthesize schedules of large networks with high communication
loads in less than one hour. We also report how the synthesis time
and the schedule quality can change with different parameter
configurations.
Bibtex
@inproceedings{Pozo4587,
author = {Francisco Pozo and Guillermo Rodriguez-Navas and Wilfried Steiner and Hans Hansson},
title = {Period-Aware Segmented Synthesis of Schedules for Multi-Hop Time-Triggered Networks},
month = {August},
year = {2016},
booktitle = {The 22th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications},
url = {http://www.es.mdu.se/publications/4587-}
}