research-article

Precise and efficient parametric path analysis

Authors:

Sebastian Altmeyer,

Rouven NaujoksAuthors Info & Claims

ACM SIGPLAN Notices, Volume 46, Issue 5

Pages 141 - 150

https://doi.org/10.1145/2016603.1967697

Published: 11 April 2011 Publication History

Abstract

Hard real-time systems require tasks to finish in time. To guarantee the timeliness of such a system, static timing analyses derive upper bounds on the worst-case execution time (WCET) of tasks. There are two types of timing analyses: numeric and parametric. A numeric analysis derives a numeric timing bound and, to this end, assumes all information such as loop bounds to be given a priori. If these bounds are unknown during analysis time, a parametric analysis can compute a timing formula parametric in these variables. A performance bottleneck of timing analyses, numeric and especially parametric, is the so-called path analysis, which determines the path in the analyzed task with the longest execution time bound.

In this paper, we present a new approach to path analysis. This approach exploits the often rather regular structure of software for hard real-time and safety-critical systems. As we show in the evaluation of this paper, we strongly improve upon former techniques in terms of precision and runtime in the parametric case. Even in the numeric case, the approach competes with state-of-the-art techniques and may be an alternative to commercial tools employed for path analysis.

References

[1]

E. Althaus, S. Altmeyer, and R. Naujoks. A new combinatorial approach to parametric path analysis. Reports of SFB/TR 14 AVACS 58, SFB/TR 14 AVACS, to appear.

[2]

S. Altmeyer, C. H&#252;umbert, B. Lisper, and R. Wilhelm. Parametric timing analyis for complex architectures. In Proceedings of the 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'08), pages 367--376. IEEE Computer Society, August 2008.

Digital Library

[3]

G. Bernat and A. Burns. An approach to symbolic worst-case execution time analysis. In 25th IFAC Workshop on Real-Time Programming. Palma (Spain)., May 2000.

[4]

S. Bygde, A. Ermedahl, and B. Lisper. An efficient algorithm for parametric wcet calculation. In Proceedings of the 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'09), pages 13--21. IEEE Computer Society, August 2009.

Digital Library

[5]

R. Chapman, A. Burns, and A.Wellings. Combining static worst-case timing analysis and program proof. Real-Time Syst., 11(2):145--171, 1996.

Digital Library

[6]

J. Coffman, C. A. Healy, F. Mueller, and D. B. Whalley. Generalizing parametric timing analysis. In Proceedings of the 7th ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems (LCTES '07), pages 152--154, 2007.

Digital Library

[7]

G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, NJ, 1963.

Digital Library

[8]

P. Feautrier. The parametric integer programming's home http: \www.piplib.org.

[9]

R. E. Gomory. An algorithm for integer solutions to linear programming. In R. L. Graves and P.Wolfe, editors, Recent Advances in Mathematical Programming, pages 269--302, New York, 1969. McGraw- Hill.

[10]

R. Heckmann and C. Ferdinand. Worst-case execution time prediction by static program analysis. In Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS'04), pages 26--30. IEEE Computer Society, 2004.

[11]

Y.-T. S. Li and S. Malik. Performance analysis of embedded software using implicit path enumeration. In Proceedings of the 32nd annual ACM/IEEE Design Automation Conference (DAC '95), pages 456-- 461. ACM, 1995.

Digital Library

[12]

B. Lisper. Fully automatic, parametric worst-case execution time analysis. In Proceedings of the Third Internation Workshop on Worst- Case Execution Time Analysis (WCET 03), pages 77--80, July 2003.

[13]

P. Puschner and C. Koza. Calculating the maximum, execution time of real-time programs. Real-Time Syst., 1(2):159--176, 1989.

Digital Library

[14]

H. Theiling. ILP-based Interprocedural Path Analysis. In Proceedings of the Workshop on Embedded Software, Grenoble, France, October 2002.

Digital Library

[15]

E. Vivancos, C. Healy, F. Mueller, and D. Whalley. Parametric timing analysis. In Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems (LCTES '01), pages 88--93. ACM Press, 2001

Digital Library

Cited By

Grebant SBallabriga CForget JLipari G(2024)Parametric WCET as a function of procedure argumentsJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2024.103086148:COnline publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1016/j.sysarc.2024.103086
Grebant SBallabriga CForget JLipari G(2023)WCET analysis with procedure arguments as parametersProceedings of the 31st International Conference on Real-Time Networks and Systems10.1145/3575757.3593655(11-22)Online publication date: 7-Jun-2023
https://dl.acm.org/doi/10.1145/3575757.3593655
Sánchez Barrera ICasas MMoretó MAyguadé ELabarta JValero M(2018)Graph partitioning applied to DAG scheduling to reduce NUMA effectsACM SIGPLAN Notices10.1145/3200691.317853553:1(419-420)Online publication date: 10-Feb-2018
https://dl.acm.org/doi/10.1145/3200691.3178535
Show More Cited By

Index Terms

Precise and efficient parametric path analysis
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Formal software verification
  2. Software organization and properties
    1. Software functional properties
      1. Formal methods

Recommendations

Parametric timing analysis and its application to dynamic voltage scaling

Embedded systems with real-time constraints depend on a priori knowledge of worst-case execution times (WCETs) to determine if tasks meet deadlines. Static timing analysis derives bounds on WCETs but requires statically known loop bounds.

This work ...
Precise and efficient parametric path analysis
LCTES '11: Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems

Hard real-time systems require tasks to finish in time. To guarantee the timeliness of such a system, static timing analyses derive upper bounds on the worst-case execution time (WCET) of tasks. There are two types of timing analyses: numeric and ...
Generalizing parametric timing analysis
Proceedings of the 2007 LCTES conference

In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis that deadlines are not missed. Static WCET analysis is performed by a timing ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 46, Issue 5

LCTES '10

May 2011

170 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/2016603

Issue’s Table of Contents

LCTES '11: Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
April 2011
182 pages
ISBN:9781450305556
DOI:10.1145/1967677
General Chair:
Jan Vitek
Purdue University, USA
,
Program Chair:
Bjorn De Sutter
Ghent University, Belgium

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 April 2011

Published in SIGPLAN Volume 46, Issue 5

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
324
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Grebant SBallabriga CForget JLipari G(2024)Parametric WCET as a function of procedure argumentsJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2024.103086148:COnline publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1016/j.sysarc.2024.103086
Grebant SBallabriga CForget JLipari G(2023)WCET analysis with procedure arguments as parametersProceedings of the 31st International Conference on Real-Time Networks and Systems10.1145/3575757.3593655(11-22)Online publication date: 7-Jun-2023
https://dl.acm.org/doi/10.1145/3575757.3593655
Sánchez Barrera ICasas MMoretó MAyguadé ELabarta JValero M(2018)Graph partitioning applied to DAG scheduling to reduce NUMA effectsACM SIGPLAN Notices10.1145/3200691.317853553:1(419-420)Online publication date: 10-Feb-2018
https://dl.acm.org/doi/10.1145/3200691.3178535
Liu JHe XLiu WTan G(2018)Register-based implementation of the sparse general matrix-matrix multiplication on GPUsACM SIGPLAN Notices10.1145/3200691.317852953:1(407-408)Online publication date: 10-Feb-2018
https://dl.acm.org/doi/10.1145/3200691.3178529
de Fine Licht JBlott MHoefler T(2018)Designing scalable FPGA architectures using high-level synthesisACM SIGPLAN Notices10.1145/3200691.317852753:1(403-404)Online publication date: 10-Feb-2018
https://dl.acm.org/doi/10.1145/3200691.3178527
Li XTan GWang BSun N(2018)High-performance genomic analysis framework with in-memory computingACM SIGPLAN Notices10.1145/3200691.317851153:1(317-328)Online publication date: 10-Feb-2018
https://dl.acm.org/doi/10.1145/3200691.3178511
Wang LYe JZhao YWu WLi ASong SXu ZKraska T(2018)SuperneuronsACM SIGPLAN Notices10.1145/3200691.317849153:1(41-53)Online publication date: 10-Feb-2018
https://dl.acm.org/doi/10.1145/3200691.3178491
Nagar KSrikant Y(2016)Fast and Precise Worst-Case Interference Placement for Shared Cache AnalysisACM Transactions on Embedded Computing Systems10.1145/285415115:3(1-26)Online publication date: 7-Mar-2016
https://dl.acm.org/doi/10.1145/2854151
Kleinsorge JMarwedel PMitra TReineke J(2014)Computing maximum blocking times with explicit path analysis under non-local flow boundsProceedings of the 14th International Conference on Embedded Software10.1145/2656045.2656051(1-10)Online publication date: 12-Oct-2014
https://dl.acm.org/doi/10.1145/2656045.2656051
de Paula R(2014)EfficiencyInteractions10.1145/257597921:2(24-25)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1145/2575979
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents