Makespan minimization of Time-Triggered traffic on a TTEthernet network
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00315286" target="_blank" >RIV/68407700:21230/17:00315286 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21730/17:00315286
Result on the web
<a href="http://dx.doi.org/10.1109/WFCS.2017.7991955" target="_blank" >http://dx.doi.org/10.1109/WFCS.2017.7991955</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/WFCS.2017.7991955" target="_blank" >10.1109/WFCS.2017.7991955</a>
Alternative languages
Result language
angličtina
Original language name
Makespan minimization of Time-Triggered traffic on a TTEthernet network
Original language description
The reliability of the increasing number of modern applications and systems strongly depends on interconnecting technology. Complex systems which usually need to exchange, among other things, multimedia data together with safety-related information, as in the automotive or avionic industry, for example, make demands on both the high bandwidth and the deterministic behavior of the communication. TTEthernet is a protocol that has been developed to face these requirements while providing the generous bandwidth of Ethernet up to 1 Gbit/s and enhancing its determinism by the Time-Triggered message transmission which follows the predetermined schedule. Therefore, synthesizing a good schedule which meets all the realtime requirements is essential for the performance of the whole system. In this paper, we study the concept of creating the communication schedules for the Time-Triggered traffic while minimizing its makespan. The aim is to maximize the uninterrupted gap for remaining traffic classes in each integration cycle. The provided scheduling algorithm, based on the Resource-Constrained Project Scheduling Problem formulation and the load balancing heuristic, obtains near-optimal (within 15% of non-tight lower bound) solutions in 5 minutes even for industrial sized instances. The universality of the provided method allows easily modify or extend the problem statement according to particular industrial demands. Finally, the studied concept of makespan minimization is justified through the concept of scheduling with porosity according to the worst-case delay analysis of Event-Triggered traffic.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA16-23509S" target="_blank" >GA16-23509S: Flexible Scheduling and Optimization Algorithms for Distributed Real-time Embedded Systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 13th International Workshop on Factory Communication Systems (WFCS)
ISBN
978-1-5090-5788-7
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
—
Publisher name
IEEE
Place of publication
Piscataway
Event location
Trondheim
Event date
May 31, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—