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
Synthesizing time-triggered schedules for switched networks with faulty links
Publication Type:
Conference/Workshop Paper
Venue:
2016 International Conference on Embedded Software (EMSOFT)
Abstract
Time-triggered (TT) switched networks are a deterministic communication
infrastructure used by real-time distributed embedded
systems. These networks rely on the notion of globally discretized
time (i.e. time slots) and a static TT schedule that prescribes which
message is sent through which link at every time slot, such that all
messages reach their destination before a global timeout. These
schedules are generated offline, assuming a static network with
fault-free links, and entrusting all error-handling functions to the
end user. Assuming the network is static is an over-optimistic view,
and indeed links tend to fail in practice. We study synthesis of TT
schedules on a network in which links fail over time and we assume
the switches run a very simple error-recovery protocol once they
detect a crashed link. We address the problem of finding a k,l-resistant
schedule; namely, one that, assuming the switches run a
fixed error-recovery protocol, guarantees that the number of messages
that arrive at their destination by the timeout is at least l, no
matter what sequence of at most k links fail. Thus, we maintain the
simplicity of the switches while giving a guarantee on the number
of messages that meet the timeout. We show how a k,l-resistant
schedule can be obtained using a CEGAR-like approach: find a
schedule, decide whether it is k,l-resistant, and if it is not, use
the witnessing fault sequence to generate a constraint that is added
to the program. The newly added constraint disallows the schedule
to be regenerated in a future iteration while also eliminating several other schedules that are not k,l-resistant. We illustrate the applicability
of our approach using an SMT-based implementation.
Bibtex
@inproceedings{Avni4586,
author = {Guy Avni and Guillermo Rodriguez-Navas and Shibashis Guha},
title = {Synthesizing time-triggered schedules for switched networks with faulty links},
month = {October},
year = {2016},
booktitle = {2016 International Conference on Embedded Software (EMSOFT)},
url = {http://www.es.mdu.se/publications/4586-}
}