Abstract Recently, the authors have proposed a scalable holistic scheduling approach for time-triggered applications on FlexRay, under end-to-end deadline and data dependency constraints. This approach divides the problem to two sub-problems that can be solved separately. The first sub-problem optimally schedules the set of messages to minimize number of used slots, and with respect to information exchanges between tasks and messages, end-to-end deadlines and FlexRay protocol constraints. The second sub-problem optimally schedules the set of tasks to minimize tasks response times, with respect to the solution returned by the first sub-problem. In this paper, our goal is to increase the scalability of our solution to each sub-problem. We propose a greedy heuristic approach for the first sub-problem that can find feasible solutions at a low runtime cost. In addition, to resolve assignment conflicts, we apply rescheduling the conflicted application with offset modification and priority promotion procedures. Furthermore, we show that the task scheduling in the second sub-problem can be divided into K independent child sub-problems, where K is the number of ECUs. Our experiments show high scalability and efficiency of our approaches comparing with our optimization-based approaches in the previous work.
Scalable Holistic Scheduling of Safety-critical Systems on In-vehicle TDMA Networks
2019
Article (Journal)
English
BKL: | 55.20$jStraßenfahrzeugtechnik / 55.20 Straßenfahrzeugtechnik |
Scalable Holistic Scheduling of Safety-critical Systems on In-vehicle TDMA Networks
Springer Verlag | 2019
|Scalable mobility: a holistic systems and safety engineering project
Automotive engineering | 2014
|British Library Conference Proceedings | 1995
|A Novel Centralized TDMA-Based Scheduling Protocol for Vehicular Networks
Online Contents | 2015
|