System level performance analysis – the SymTA/S approach

System level performance analysis – the SymTA/S approach

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IEE Proceedings - Computers and Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

SymTA/S is a system-level performance and timing analysis approach based on formal scheduling analysis techniques and symbolic simulation. The tool supports heterogeneous architectures, complex task dependencies and context aware analysis. It determines system-level performance data such as end-to-end latencies, bus and processor utilisation, and worst-case scheduling scenarios. SymTA/S furthermore combines optimisation algorithms with system sensitivity analysis for rapid design space exploration. The paper gives an overview of current research interests in the SymTA/S project.


    1. 1)
      • Scheduling algorithm for multi-programming in a hard-real-time environment
    2. 2)
      • Jensen, C.L.E, Tokuda, H.: `A time-driven scheduling model for real-time operating systems', Proc. 6th IEEE Real-Time Systems Symp. (RTSS 1985) IEEE CS Press, p. 112–122
    3. 3)
    4. 4)
      • Gutierrez, J.J., Palencia, J.C., Harbour, M.G.: `On the schedulability analysis for distributed hard real-time systems', Proc. 9th Euromicro Workshop on Real-Time Systems, June 1997, Toledo, Spain, p. 136–143
    5. 5)
      • Gresser, K.: `An event model for deadline verification of hard real-time systems', Proc. 5th Euromicro Workshop on Real-Time Systems, 1993, Oulu, Finland, p. 118–123
    6. 6)
      • Thiele, L., Chakraborty, S., Naedele, M.: `Real-time calculus for scheduling hard real-time systems', Proc. Int. Symp. on Circuits and Systems (ISCAS), 2000, Geneva, Switzerland
    7. 7)
      • An extendible approach for analysing fixed priority hard real-time systems
    8. 8)
      • Hamann, A., Henia, R., Jersak, M., Racu, R., Richter, K., and Ernst, R.: SymTA/S – symbolic timing analysis for systems.
    9. 9)
      • Richter, K., Ernst, R.: `Event model interfaces for heterogeneous system analysis', Proc. Design, Automation and Test in Europe Conf. (DATE'02), Mar. 2002, Paris, France
    10. 10)
      • Richter, K., Ziegenbein, D., Jersak, M., Ernst, R.: `Model composition for scheduling analysis in platform design', Proc. 39th Design Automation Conf., June 2002, New Orleans, USA
    11. 11)
      • A formal approach to MpSoC performance verification
    12. 12)
      • Richter, K., Racu, R., Ernst, R.: `Scheduling analysis integration for heterogeneous multiprocessor SoC', Proc. 24th Int. Real-Time Systems Symp. (RTSS'03), Dec 2003, Cancun, Mexico
    13. 13)
    14. 14)
      • Design space exploration of network processor architectures, Network Processor Design Issues and Practices
    15. 15)
      • Richter, K.: `Compositional performance analysis', 2004, PhD thesis, Technical University of Braunschweig
    16. 16)
      • Tindell, K., Kopetz, H., Wolf, F., Ernst, R.: `Safe automotive software development', Proc. Design, Automation and Test in Europe (DATE'03), Mar. 2003, Munich, Germany
    17. 17)
      • Technical University of Braunschweig: SymTA/S – symbolic timing analysis for systems.
    18. 18)
      • Jersak, M., Ernst, R.: `Enabling scheduling analysis of heterogeneous systems with multi-rate data dependencies and rate intervals', Proc. 40th Design Automation Conf., June 2003, Annaheim, USA
    19. 19)
      • Jersak, M.: `Compositional performance analysis for complex embedded applications', 2004, PhD thesis, Technical University of Braunschweig
    20. 20)
      • Ziegenbein, D.: `A compositional approach to embedded system design', 2003, PhD thesis, Technical University of Braunschweig
    21. 21)
      • Synchronous data flow
    22. 22)
      • Houri, M.Y.: `Task graph analysis with complex dependencies', 2004, Master's thesis, Institute of Computer and Communication Networks Engineering, Technical University of Braunschweig
    23. 23)
    24. 24)
      • SPI – A system model for heterogeneously specified embedded systems
    25. 25)
      • Jersak, M., Henia, R., Ernst, R.: `Context-aware performance analysis for efficient embedded system design', Proc. Design Automation and Test in Europe, Mar. 2004, Paris, France
    26. 26)
      • Tindell, K.W.: `Adding time-offsets to schedulability analysis', YCS 221, Technical, 1994
    27. 27)
      • Palencia, J.C., Harbour, M.G.: `Schedulability analysis for tasks with static and dynamic offsets', Proc. 19th IEEE Real-Time Systems Symp. (RTSS98), 1998, Madrid, Spain
    28. 28)
      • Laumanns, M., Thiele, L., Zitzler, E., Welzl, E., and Deb, K.: Running time analysis of multi-objective evolutionary algorithms on a simple discrete optimisation problem. Parallel Problem Solving from Nature, PPSN VII, 2002
    29. 29)
      • Zitzler, E., Laumanns, M., Thiele, L.: `SPEA2: Improving the strength Pareto evolutionary algorithm'', CH-8092, Technical, 2001
    30. 30)
      • Bleuler, S., Laumanns, M., Thiele, L., and Zitzler, E.: PISA – a platform and programming language independent interface for search algorithms.
    31. 31)
      • Davis, L.: `Applying adaptive algorithms to epistatic domains', Proc. 9th IJCAI, 1985, Los Angeles, CA, p. 162–164
    32. 32)
    33. 33)
      • Lehoczky, J., Sha, L., Ding, Y.: `The rate monotonic scheduling algorithm: Exact characterization and average case behavior', Proc. Real-Time Systems Symp., 1989, p. 201–209
    34. 34)
    35. 35)
      • Punnekkat, S., Davis, R., Burns, A.: `Sensitivity analysis of real-time task sets', Proc. 3rd Asian Computing Science Conf., ASIAN'97, 1997, p. 72–82
    36. 36)
      • Applying new scheduling theory to static priority preemptive scheduling

Related content

This is a required field
Please enter a valid email address