Optimization of hierarchically scheduled heterogeneous embedded systems

We present an approach to the analysis and optimization of heterogeneous distributed embedded systems for hard real-time applications. The systems are heterogeneous not only in terms of hardware components, but also in terms of communication protocols and scheduling policies. When several scheduling policies share a resource, they are organized in a hierarchy. In this paper, we address design problems that are characteristic to such hierarchically scheduled systems: assignment of scheduling policies to tasks, mapping of tasks to hardware components, and the scheduling of the activities. We present algorithms for solving these problems. Our heuristics are able to find schedulable implementations under limited resources, achieving an efficient utilization of the system.

[1]  D. Parnas,et al.  On satisfying timing constraints in hard-real-time systems , 1991, SIGSOFT '91.

[2]  Petru Eles,et al.  Analysis and Synthesis of Distributed Real-Time Embedded Systems , 2004, Springer US.

[3]  Jörg Kaiser,et al.  EDF Consensus on CAN Bus Access for Dynamic Real-Time Applications , 1998, IPPS/SPDP Workshops.

[4]  Hermann Kopetz,et al.  Real-time systems , 2018, CSC '73.

[5]  Alan Burns,et al.  Fixed priority pre-emptive scheduling: An historical perspective , 1995, Real-Time Systems.

[6]  Ronald L. Graham,et al.  Optimal scheduling for two-processor systems , 1972, Acta Informatica.

[7]  Alan Burns,et al.  Real Time Scheduling Theory: A Historical Perspective , 2004, Real-Time Systems.

[8]  Petru Eles,et al.  Schedulability analysis for distributed heterogeneous time/event triggered real-time systems , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

[9]  Giorgio C. Buttazzo,et al.  Rate Monotonic vs. EDF: Judgment Day , 2003, Real-Time Systems.

[10]  Henrik Lönn,et al.  A comparison of fixed-priority and static cyclic scheduling for distributed automotive control applications , 1999, Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99.

[11]  Alan Burns,et al.  The End Of The Line For Static Cyclic Scheduling? , 1993, Fifth Euromicro Workshop on Real-Time Systems.

[12]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[13]  John A. Clark,et al.  Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[14]  John M. Rushby,et al.  Bus Architectures for Safety-Critical Embedded Systems , 2001, EMSOFT.

[15]  J. Javier Gutiérrez,et al.  Optimized priority assignment for tasks and messages in distributed hard real-time systems , 1995, Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems.

[16]  Joseph Kee-Yin Ng,et al.  Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05): Foreword , 2005 .

[17]  Paolo Giusto,et al.  A universal communication model for an automotive system integration platform , 2001, Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001.

[18]  Paulo Pedreiras,et al.  Combining event-triggered and time-triggered traffic in FTT-CAN: analysis of the asynchronous messaging system , 2000, 2000 IEEE International Workshop on Factory Communication Systems. Proceedings (Cat. No.00TH8531).

[19]  Giuseppe Lipari,et al.  Resource partitioning among real-time applications , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

[20]  Michael González Harbour,et al.  Response time analysis for tasks scheduled under EDF within fixed priorities , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.