Memetic-based schedule synthesis for communication on time-triggered embedded systems

Heyuan Shi,Chengbao Liu,Xiaoyu Song,Jiaguang Sun,Chao Hu,Kun Tang

doi:10.1177/1550147717738167

Abstract

Time-triggered systems play an important role in industrial embedded systems. The time-triggered network is deployed on the time-triggered network-on-chip implementation. It ensures the safety-critical industrial communication for real-time embedded multiprocessor systems. To guarantee the safety-critical requirements for communication, each message is transmitted by a predefined static schedule. However, synthesizing a feasible schedule is a challenge because both spatial and temporal constraints should be considered. This article presents a novel memetic-based schedule synthesis algorithm to derive a feasible schedule by determining the offset of messages on the time-triggered network-on-chip. Memetic-based schedule synthesis algorithm is based on memetic algorithm, which incorporates local search in the iterations of general genetic algorithm. We compare memetic-based schedule synthesis algorithm with genetic algorithm in different scale of time-triggered network-on-chip and number of messages. The experimental results show that the memetic-based schedule synthesis algorithm is effective to synthesize a feasible schedule, and the failure schedule synthesized by memetic-based schedule synthesis algorithm is only 34.2% in average compared to the conventional genetic algorithm.

Highlights

Time-triggered systems is one of the real-time systems for industrial multiprocessor systems.[1]
We first review the related work consists various algorithm to synthesize schedule based on different architectures in section ‘‘Related work.’’ And the problem formulation consists of system model, and constraints are given in section ‘‘Problem formulation.’’ the detail of memetic-based schedule synthesis algorithm (MSSA) is proposed in section ‘‘Memetic-based schedule synthesis algorithm.’’ The experimental results are shown in section ‘‘Evaluations.’’ we conclude this article in section ‘‘Conclusion and future work.’’
MSSA deploys the genetic algorithm (GA) as the global search strategy, and the subset of infeasible schedule is chosen as the element to minimize its contention times

Summary

Introduction

Time-triggered systems is one of the real-time systems for industrial multiprocessor systems.[1]. For the network-based architecture, it allows a set of messages to be transmitted at the same time, provided that the physical links used by the messages are contention-free. We first review the related work consists various algorithm to synthesize schedule based on different architectures in section ‘‘Related work.’’ And the problem formulation consists of system model, and constraints are given in section ‘‘Problem formulation.’’ the detail of MSSA is proposed in section ‘‘Memetic-based schedule synthesis algorithm.’’ The experimental results are shown in section ‘‘Evaluations.’’ we conclude this article in section ‘‘Conclusion and future work.’’

Related work

Schedule synthesis model

Motivation

Findings

Schedule

Conclusion and future work