2015 · 43 citations · 6 references
ComputingComputer EngineeringComputer ScienceComputer NetworksReal-time SystemsSchedulingLatency OptimizationNetwork ProtocolsReal-time Communication ProtocolsReal-time SchedulingReal-time Systems DesignSchedulability AnalysisBoolean Satisfiability Modulo TheoriesJitterLow-latency CommunicationNetwork SchedulingSchedule SynthesisTime-triggered EthernetTime-triggered ProtocolsTime-triggered Systems
Time-triggered networks, like TTEthernet, require adoption of a predefined schedule to guarantee low communication latency and minimal jitter. The synthesis of such schedules is a problem known to be NP-complete. In the past, specialized solvers have been used for synthesizing time-triggered schedules, but more recently general-purpose tools like Satisfiability Modulo Theories (SMT) solvers have reported synthesis of large network schedules in reasonable time for industrial purposes. An interesting characteristic of any general-purpose tool is that its configuration parameters can be tuned in order to fit specific problems and achieve increased performance. This paper presents a study identifying and assessing which SMT solver parameters have the highest impact on the performance when synthesizing schedules for time-triggered networks. The results show that with appropriate values of certain parameters, the time can be reduced significantly, up to 75% in the best cases compared to previous work.
6
The time-triggered architecture
Hermann Kopetz, G. Bauer · Proceedings of the IEEE · 2003 · 852 citations
Satisfiability modulo theories
Leonardo de Moura, Nikolaj Bjørner · Communications of the ACM · 2011 · 629 citations
The cyclic executive model and Ada
T. P. Baker, Alan Shaw · Real-Time Systems · 1989 · 164 citations