Abstract
Traditional Worst-Case Execution-Time (WCET) analysis is very complex. It has to deal with path analysis, to identify and describe the possible execution paths through the code to be analyzed, and it has to model the worst-case timing of the possible paths on the target hardware. The latter is again nontrivial due to interference of modern hardware features like instruction pipelines, caches, and parallel instruction-execution units on the processor.
To simplify WCET analysis we have proposed a new programming paradigm, single-path programming. Every program following this paradigm has only a single possible execution path, which makes path analysis and thus WCET analysis almost trivial. In this work we show how any real-time program code that is WCET-analyzable can be transformed into single-path code. This demonstrates that the single-path paradigm provides a universal solution to simplify WCET analysis.
The updated original online version for this book can be found at DOI: 10.1007/978-0-387-35599-3_29
Chapter PDF
Similar content being viewed by others
References
Allen, J., Kennedy, K., Porterfield, C., and Warren, J. 1983. Conversion of Control Dependence to Data Dependence. Proceedings of the 10th ACM Symposium on Principles of Programming Languages: 177–189.
Colin, A., and Puaut, I. 2000. Worst Case Execution Time Analysis for a Processor with Branch Prediction. Real-Time Systems, 18 (2/3): 249–274.
Engblom, J., and Ermedahl, A. 2000. Modeling Complex Flows for Worst-Case Execution Time Analysis. Proceedings of the 21st IEEE Real-Time Systems Symposium: 163–174.
Kopetz, H. 1997. Real-Time Systems. Kluwer Academic Publishers.
Lundqvist, T., and Stenström, P. 1999. Timing Anomalies in Dynamically Scheduled Microprocessors. Proceedings of the 20th IEEE Real-Time Systems Symposium: 12–21. Motorola Inc. 1997. M-Core Reference Manual.
Park, J., and Schlansker, M. 1991. On Predicated Execution. Technical Report HPL-91–58, Hewlett Packard Software and Systems Laboratory, Palo Alto, CA, USA.
Petters, S., and Färber, G. 1999. Making Worst Case Execution Time Analysis for Hard Real-Time Tasks on State of the Art Processors Feasible. Proceedings of the 6th IEEE International Conference on Real-Time Computer Systems and Applications: 442–449.
Puschner, P., and Bums, A. 2000. Guest Editorial: A Review of Worst-Case Execution-Time Analysis. Real-Time Systems, 18 (2/3): 115–127.
Puschner, P., and Bums, A. 2002. Writing Temporally Predictable Code. Proceedings of the 7th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Puschner, P. (2002). Transforming Execution-Time Boundable Code into Temporally Predictable Code. In: Kleinjohann, B., Kim, K.H., Kleinjohann, L., Rettberg, A. (eds) Design and Analysis of Distributed Embedded Systems. DIPES 2002. IFIP — The International Federation for Information Processing, vol 91. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35599-3_17
Download citation
DOI: https://doi.org/10.1007/978-0-387-35599-3_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4937-3
Online ISBN: 978-0-387-35599-3
eBook Packages: Springer Book Archive