Complex task activation schemes in system level performance analysis

ABSTRACT

The design and analysis of today's complex real-time systems requires advanced methods. Due to ever growing functionality, hardware complexity and component interaction, applying traditional methods like HW/SW cosimulation is getting increasingly difficult. On the other hand, analytic approaches have proven their usefulness and efficiency for system analysis when end-to-end performance figures like delay, throughput and memory consumption are requested. One of the main drawbacks of these methods is the limited set of systems that can be analyzed with high accuracy: Only simple models for task interaction and task semantics can be used. In this paper, we extend existing methods for analyzing heterogeneous multiprocessor systems such that (a) nonpreemptive scheduling policies, (b) complex activation schemes for tasks and (c) conditional behavior of task executions can be modeled and analyzed. We demonstrate the usefulness of the proposed approach in a case study.

REFERENCES

• 1: Samarjit Chakraborty , Simon Kunzli , Lothar Thiele, A General Framework for Analysing System Properties in Platform-Based Embedded System Designs, Proceedings of the conference on Design, Automation and Test in Europe, p.10190, March 03-07, 2003
• 2: R. L. Cruz. A Calculus for Network Delay, Part I: Network Elements in Isolation. IEEE Trans. Inform. Theory, 37(1):114--131, Jan. 1991.
• 3: M. González Harbour , J. J. Gutiérrez García , J. C. Palencia Gutiérrez , J. M. Drake Moyano, MAST: Modeling and Analysis Suite for Real Time Applications, Proceedings of the 13th Euromicro Conference on Real-Time Systems, p.125, June 13-15, 2001
• 4: R. Henia, A. Hamann, M. Jersak, R. Racu, K. Richter, and R. Ernst. System Level Performance Analysis -- The SymTA/S Approach. IEE Proceedings Computers and Digital Techniques, 152(2):148--166, Mar. 2005.
• 5: M. Jersak, K. Richter, and R. Ernst. Performance Analysis for Complex Embedded Systems. Int'l Journal of Embedded Systems, 1(1-2):33--49, 2005.
• 6: Jean-Yves Le Boudec , Patrick Thiran, Network calculus: a theory of deterministic queuing systems for the internet, Springer-Verlag New York, Inc., New York, NY, 2001
• 7: J. Schmitt. On Average and Worst Case Behaviour in Non-Preemptive Priority Queuing. In Proc. 2003 Int'l Symp. on Performance Evaluation of Computer and Telecommunication Systems, pages 197--204, 2003.
• 8: Ernesto Wandele , Lothar Thiele, Abstracting functionality for modular performance analysis of hard real-time systems, Proceedings of the 2005 conference on Asia South Pacific design automation, January 18-21, 2005, Shanghai, China [doi>10.1145/1120725.1120997]

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.3 SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS
      Subjects: Real-time and embedded systems

Additional Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Modeling techniques

General Terms:
Design, Performance, Theory

Keywords:
nonpreemptive scheduling, performance analysis, task activation