You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Theories for Estimating Execution Times in Soft Real-Time Systems Applied in the Telecommunication Domain

Fulltext:


Authors:

Johan Erikson , Jouni Axelsson

Publication Type:

Report

Publisher:

MRTC and IDt, Mälardalen University


Abstract

Real-time systems are normally divided into two classes: Hard and Soft. The difference lies in how critical it is to meet the systems timing constraints. In a hard real-time system, every deadline must be met. If not, the conse- quences to the environment is above an accepted level. On account of this, the Worst Case Execution Time is in focus for a number of proposed ap- proaches. A soft real-time system, on the other hand, is characterized by the fact that a missed deadline do not cause system failure and do not cause damage to the environment. This is most likaly the reason why timing constraints in soft real-time systems are handled by diÿerent ad hoc solutions. (E.g. Do not write more than k lines of code in one block.) But even if a missed deadline is not directly dangerous, the consequences may indirectly be serious. In this report, we propose a more systematic approach to handle execution times in soft real-time systems. A combination of graphical representation of the system together with information on loops, gives the developers a pic- ture of the execution time which enable identi½cation of critical areas and parts that use much time relative other parts of the system. The graphical representation is annotated with estimated execution times. Loop detection is based on DJ graphs and processes the control ²ow graph of the program which, in our case, is extracted from the back end of the compiler. The theories is applied in the telecommunication domain where the targeted system (the AXE telecommunication system from Ericsson) has about 10 milion lines of code spread over about 1000 executable units, continously developed during 25 years.

Bibtex

@techreport{Erikson291,
author = {Johan Erikson and Jouni Axelsson},
title = {Theories for Estimating Execution Times in Soft Real-Time Systems Applied in the Telecommunication Domain},
month = {October},
year = {2001},
publisher = {MRTC and IDt, M{\"a}lardalen University},
url = {http://www.es.mdh.se/publications/291-}
}