Skip to main content
Log in

Schedule construction under precedence constraints in flexray in-vehicle networks

  • Published:
International Journal of Automotive Technology Aims and scope Submit manuscript

Abstract

As embedded time-triggered applications have widely replaced mechanical systems in modern automobiles, holistic scheduling of tasks and messages of such applications on in-vehicle networks has become a critical issue. For offering QoS (Quality of Service) guarantees, the holistic schedule must satisfy numerous constraints such as protocol specifications, delay constraints and precedence constraints between tasks schedules and messages transmissions. Existing approaches to this problem search through a vast design space of all possible joint task and message schedules. This leads to a high complexity and limits the scalability of such approaches for scheduling the large scale systems. To cope with this problem, we propose an approach that divides the holistic scheduling problem to two sub-problems: the sub-problem of message scheduling and the sub-problem of task scheduling, while precedence relations and end-to-end information passing between task instances and messages are preserved and the end-to-end deadlines are guaranteed. This helps to reduce the workload on the problem solvers and improves efficiency and scalability. In the first sub-problem, our approach optimizes scheduling the set of messages and allocates time windows for scheduling each task with respect to precedence constraints, end-to-end deadlines and FlexRay protocol specifications. The length of each time window helps to preserve the respective tasks schedulability and to provide flexibility for both task and message scheduling. The objective is defined with respect to extensibility issues. In the second sub-problem, our approach optimizes schedule of the set of tasks with respect to their allocated time windows and timing constraints. The objective is defined with respect to latency issues. We optimize the solution to each sub-problem using Mixed Integer Linear Programming optimization framework. Performance evaluations show that, compared with existing holistic scheduling approaches, our approach is more scalable and obtains better solutions in a reasonable amount of time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Abbreviations

L :

length of FlexRay cycle

H :

number of communication cycles in a FlexRay cycle

l slot :

length of static slot

n slot :

number of static slots in static segment

l CC :

length of communication cycle

G :

application DAG

V :

set of tasks

E :

set of messages

τ i :

i-th task in a given application

ECU(τ i):

ECU that hosts τ i

HP i :

set of tasks with higher priority than τ i running in ECU(τ i)

T i :

period of invocations of τ i

C i :

execution time of τ i

D i :

relative deadline of τ i

WCRT(τ i):

worst case response time of τ i

τ i,p :

p-th job of the task τ i

M :

set of messages communicating on the bus

m i,p :

generated message by τ i,p

r i. :

repetition rate of m i

w i :

size of message m i in bits

G=(V,E):

DAG of application g

Instance-Graph(g):

instance graph of application g

SC i,p :

set of successors of τ i,p running in ECU(τi)

PD i,p :

set of predecessors of τ i,p running in ECU(τi)

V i,p j,q :

set of jobs in the path between m i,p and m j,q

Reduced-Graph(g):

reduced DAG of Instance-Graph(g)

tw i,p j,q :

time window assigned to jobs in V i,p j,q

ltw i,p j,q :

length of time window tw i,p j,q

D(m i,p,m j,q)max:

maximum required length for tw i,p j,q

R i,j :

a lower bound for the length of tw i,p j,q

u i :

assigned FID to m i

b i :

assigned base cycle to m i

X i,p k,n :

mapping of m i,p to a slot; true if m i,p is assigned to the k-th slot of the n-th CC

\({A_{k,n,EC{U_e}}}\) :

ownership of a slot by an ECU; true if ECU e is assigned to the k-th slot of the n-th CC

Φ i :

initial phase of task τ i

a i,p :

arrival time of task instance τ i,p

s i,p :

start time of task instance τ i,p

f i,p :

finish time of task instance τ i,p

References

  • Abdelzaher, T. F. and Shin, K. G. (1999). Combined task and message scheduling in distributed real-time systems. IEEE Trans. Parallel and Distributed Systems 10, 11, 1179–1191.

    Article  Google Scholar 

  • Astrom, K. J. and Wittenmark, B. (1997). Computer-Controlled Systems: Theory and Design. 3rd edn. Prentice-Hall. Englewood Cliffs, New Jersey, USA.

    Google Scholar 

  • Cottet, F., Delacroix, J., Kaiser, C. and Mammeri, Z. (2002). Scheduling in Real-time Systems. 1st edn. John Wiley & Sons. New York, USA.

    Book  Google Scholar 

  • Ding, S., Murakami, N., Tomiyama, H. and Takada, H. (2005). A GA-based scheduling method for flexray systems. Proc. ACM, 110-113. eCos.

    Google Scholar 

  • Embedded Configurable Operating System (2002). http://ecos.sourceware.org

  • Grenier, M., Havet, L. and Navet, N. (2008). Configuring the communication on FlexRay: The case of the static segment. Proc. 4th European Cong. Embedded Real Time Software.

    Google Scholar 

  • Hu, M., Luo, J., Wang, Y., Lukasiewycz, M. and Zeng, Z. (2014). Holistic scheduling of real-time applications in time-triggered in-vehicle networks. IEEE Trans. Industrial Informatics 10, 3, 1817–1828.

    Article  Google Scholar 

  • Hu, M., Luo, J., Wang, Y., Lukasiewycz, M. and Zeng, Z. (2015). Scheduling periodic task graphs for safetycritical time-triggered avionic systems. IEEE Trans. Aerospace and Electronic Systems 51, 3, 2294–2304.

    Article  Google Scholar 

  • IBM ILOG CPLEX, Ver. 12.2 (2011). http://www.ibm.com/ software

  • Kang, M., Park, K. and Jeong, M. (2013). Frame packing for minimizing the bandwidth consumption of the FlexRay static segment. IEEE Trans. Industrial Electronics 60, 9, 4001–4008.

    Article  Google Scholar 

  • Kopetz, H. and Bauer, G. (2003). The time-triggered architecture. Proc. IEEE, 91, 1, 112–126.

    Article  Google Scholar 

  • Lukasiewycz, M., Gla, M., Teich, J. and Milbredt, P. (2009). FlexRay schedule optimization of the static segment. Proc. 7th IEEE/ACM Int. Conf. Hardware/Software Codesign and System Synthesis, 363–372.

    Google Scholar 

  • Lukasiewycz, M., Schneider, R., Goswami, D. and Chakraborty, S. (2012). Modular scheduling of distributed heterogeneous time-triggered automotive systems. Proc. 17th Asia South Pacific Design Autom. Conf. (ASPDAC), 665–670.

    Chapter  Google Scholar 

  • Natale, M. D. and Zeng, H. (2010). Time determinism and semantics preservation in the implementation of distributed functions over flexray. SAE Paper No. 2010-01-0452.

    Google Scholar 

  • Navet, N., Song, Y., Simonot-Lion, F. and Wilwert, C. (2005). Trends in automotive communication systems. Proc. IEEE 93, 6, 1204–1223.

    Article  Google Scholar 

  • OSEK/VDX Operating System Specification Ver. 2.2.3 (2005). http://www.osek-vdx.org

  • Palencia, J. C. and Harbour, M. G. (1999). Exploiting precedence relations in the schedulability analysis of distributed real-time systems. Proc. 20th IEEE Real-Time Systems Symp., 328–339.

    Google Scholar 

  • Peng, D., Shin, K. G. and Abdelzaher, T. F. (1997). Assignment and scheduling communicating periodic tasks in distributed real-time systems. IEEE Trans. Software Engineering 23, 12, 745–758.

    Article  Google Scholar 

  • Pop, P., Poulsen, K. H., Izosimov, V. and Eles, P. (2007). Scheduling and voltage scaling for energy/reliability trade-offs in fault-tolerant time-triggered embedded systems. Proc. 5th IEEE/ACM Int. Conf. Hardware/ Software Codesign and System Synthesis, 233–238.

    Google Scholar 

  • Schenkelaars, T., Vermeulen, B. and Goossens, K. (2011). Optimal scheduling of switched FlexRay networks. Proc. Design, Automation & Test in Europe Conf. & Exhibition, 1–6.

    Google Scholar 

  • Schmidt, K. and Schmidt, E. G. (2009). Message scheduling for the FlexRay protocol: The static segment. IEEE Trans. Vehicular Technology 58, 5, 2170–2179.

    Article  Google Scholar 

  • Tanasa, B., Bordoloi, U. D., Eles, P. and Peng, Z. (2010). Scheduling for fault-tolerant communication on the static segment of FlexRay. Proc. IEEE Real-Time Systems Symp. (RTSS), 385–394.

    Google Scholar 

  • The Autosar Consortium. Autosar Flexray Interface Driver Specification Ver. 4.0 (2010). http://www.autosar.org

  • The FlexRay Communication System Protocol Specification, Ver. 3.0.1 (2010). http://www.flexray.com

  • TTCAN (2009). http://www.can-cia.org/can/ttcan

  • Xiuqiang, H., Mingxuan, Y. and Zonghua, G. (2008). A hierarchical framework for design space exploration and optimization of TTP-based distributed embedded systems. IEEE Trans. Industrial Informatics 4, 4, 237–249.

    Article  Google Scholar 

  • Youn, J., Park, I. and Sunwoo, M. (2013). Heuristic resource allocation and scheduling method for distributed automotive control systems. Int. J. Automotive Technology 14, 4, 611–624.

    Article  Google Scholar 

  • Zeng, H., Natale, M., Ghosal, A. and Sangiovanni-Vincentelli, A. (2011). Schedule optimization of timetriggered systems communicating over the FlexRay static segment. IEEE Trans. Industrial Informatics 7, 1, 1–17.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Myung Kyun Kim.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Darbandi, A., Yoon, S. & Kim, M.K. Schedule construction under precedence constraints in flexray in-vehicle networks. Int.J Automot. Technol. 18, 671–683 (2017). https://doi.org/10.1007/s12239-017-0067-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12239-017-0067-8

Key words

Navigation