Towards Automated Generation of Time-Predictable Code

Authors Daniel Prokesch, Benedikt Huber, Peter Puschner

Thumbnail PDF


  • Filesize: 0.56 MB
  • 10 pages

Document Identifiers

Author Details

Daniel Prokesch
Benedikt Huber
Peter Puschner

Cite AsGet BibTex

Daniel Prokesch, Benedikt Huber, and Peter Puschner. Towards Automated Generation of Time-Predictable Code. In 14th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 39, pp. 103-112, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


Knowledge of the worst-case execution time of software components is essential in safety-critical hard real-time systems. The analysis thereof is not trivial as the execution time depends on many factors, including the underlying hardware platform, the program structure, and the code produced by the compiler. Often, the execution time is variable and highly sensitive to the input data the program has to process. This paper presents a code transformation applicable in a compiler backend that produces time-predictable code. The resulting code contains a single input-data independent execution path, in order to obtain programs of stable timing behaviour. The transformation technique has been validated by applying it on a number of benchmarks. Experiments show a reduction of execution time variability, at acceptable costs for the single execution path.
  • Single-Path
  • Graph Transformation
  • Predictable Code
  • Compiler


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Jeanne Ferrante, Karl J. Ottenstein, and Joe D. Warren. The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst., 9(3):319-349, July 1987. Google Scholar
  2. Hemendra Singh Negi, Abhik Roychoudhury, and Tulika Mitra. Simplifying wcet analysis by code transformations. In Workshop on Worst-Case Execution-Time Analysis (WCET), September 2004. Google Scholar
  3. Joseph C.H. Park and Mike Schlansker. On predicated execution. Technical report, Hewlett Peckard Software and Systems Laboratory, May 1991. Google Scholar
  4. Peter Puschner. The single-path approach towards wcet-analysable software. In 2003 IEEE International Conference on Industrial Technology, volume 2, pages 699-704 Vol.2, 2003. Google Scholar
  5. Peter Puschner, Raimund Kirner, Benedikt Huber, and Daniel Prokesch. Compiling for time predictability. In Proc. SAFECOMP 2012 Workshops (LNCS 7613), pages 382-391. Springer, 2012. Google Scholar
  6. Peter Puschner, Daniel Prokesch, Benedikt Huber, Jens Knoop, Stefan Hepp, and Gernot Gebhard. The T-CREST approach of compiler and WCET-analysis integration. In Proceedings of the 9th Workshop on Software Technologies for Future Embedded and Ubiquitious Systems (SEUS 2013), 2013. Google Scholar
  7. Martin Schoeberl, Pascal Schleuniger, Wolfgang Puffitsch, Florian Brandner, Christian W. Probst, Sven Karlsson, and Tommy Thorn. Towards a time-predictable dual-issue microprocessor: The Patmos approach. In First Workshop on Bringing Theory to Practice: Predictability and Performance in Embedded Systems (PPES 2011), pages 11-20, March 2011. Google Scholar
  8. Robert Endre Tarjan. Testing flow graph reducibility. J. Comput. Syst. Sci., 9(3):355-365, December 1974. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail