IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v13y2017i10p1550147717738167.html
   My bibliography  Save this article

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

Author

Listed:
  • Heyuan Shi
  • Kun Tang
  • Chengbao Liu
  • Xiaoyu Song
  • Chao Hu
  • Jiaguang Sun

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.

Suggested Citation

  • Heyuan Shi & Kun Tang & Chengbao Liu & Xiaoyu Song & Chao Hu & Jiaguang Sun, 2017. "Memetic-based schedule synthesis for communication on time-triggered embedded systems," International Journal of Distributed Sensor Networks, , vol. 13(10), pages 15501477177, October.
  • Handle: RePEc:sae:intdis:v:13:y:2017:i:10:p:1550147717738167
    DOI: 10.1177/1550147717738167
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717738167
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147717738167?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:13:y:2017:i:10:p:1550147717738167. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.