Skip to main content
Log in

WCET Analysis of Superscalar Processors Using Simulation With Coloured Petri Nets

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

Determining a tight WCET of a block of code to be executed on a modern superscalar processor architecture is becoming ever more difficult due to the dynamic behaviour exhibited by current processors, which include dynamic scheduling features such as speculative and out-of-order execution in the context of multiple execution units with deep pipelines. We describe the use of Coloured Petri Nets (CP-nets) in a simulation based approach to this problem. A complex model of a generic processor architecture is described, with emphasis on the modelling strategy for obtaining the WCET and an analysis of the results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Appel, A. W., and MacQueen, D. B. 1991. Standard ML of New Jersey. In Third Int. Symp. on Programming Languages Implementation and Logic Programming, Maluszyński, J., and Wirsing, M., eds. Lecture Notes on Computer Science, Volume 528, Springer.

  • Arvind, D. K., and Rebello, V. E. F. 1994. Instruction-level parallelism in asynchronous processor architectures. In Proceedings of the Third Int. Workshop on Algorithms and Parallel VLSI Architectures, Moonen, M., and Catthoor, F., eds. Elsevier Science Publishers, Leuven, Belgium, pp. 203–215.

    Google Scholar 

  • Burns, F. P., Koelmans, A. M., and Yakovlev, A. V. 1999. Analysing superscalar processor architectures with coloured Petri nets. Int. J. Software Tools for Technology Transfer 2: 182–191.

    Google Scholar 

  • Choi, J., Lee, J., and Kong, I. 1994. Timing Analysis of Superscalar Programs using ACSR. Technical report, Dept. of Computer and Information Science, University of Pennsylvania.

  • Christensen, S., Jorgensen, J. B., and Kristensen, L.M. 1997. Design/CPN-A computer tool for coloured Petri nets. In Proceedings of Tacas '97, Brinksma, E., ed. Lecture Notes on Computer Science, Volume 1217, Springer, pp. 209–223.

  • Diep, T. A. 1995. A visualization based microarchitecture workbench. Proc. Caregie Mellon University, PhD Thesis.

  • Healy, C., Whalley, D. B., and Harmon, M. G. 1995. Integrating the timing analysis of pipelining and instruction caching. Proc. 16th Conf. Real-Time Systems Symposium.

  • Jensen, K. 1997. Coloured Petri nets. Basic concepts, analysis methods and practical use. Volume 1, Basic concepts. EATCS Monographs in Theoretical Computer Science, Springer-Verlag, ISBN 3-540-58276-2.

  • Johnson, M. 1991. Superscalar Microprocessor Design. Prentice Hall.

  • Li, Y. S., Malik, S., and Wolfe, A. 1995. Performance estimation of embedded software with instruction cache modelling. Proc. Int. Conf. Computer Aided Design.

  • Lim, S. S., Bae, Y. H., Jang, G. T., Rhee, B. D., Min, S. L., Park, C. Y., Shin, H., Park, K., and Kim, C. S. 1994. An accurate worst case timing analysis technique for RISC processors. Proc 15th IEEE Real-Time Systems Symp.: 97–108.

  • Lim, S. S., Han, J. H., Kim, J., and Min, S. L. 1998. A worst case timing analysis technique for multiple-issue machines. Proc. 19th Conf. Real-Time Systems Symposium.

  • Narasimham, K., and Nilsen, K. D. 1994. Portable execution time analysis for RISC processors. Languages, Compilers, and Tools for Real-Time Systems.

  • Park, C. Y. 1993. Predicting program execution times by analyzing static and dynamic program paths. J. Real Time Systems 5(1): 31–61.

    Google Scholar 

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

    Google Scholar 

  • Razouk, R. R. 1987. The use of Petri nets for modeling pipelined processors. Technical Report 87-29, University of California, Department of Information and Computer Science.

  • Shaw, A. C. 1989. Reasoning about time in higher-level language software. IEEE Trans. Software Engineering 15(7): 875–889.

    Google Scholar 

  • Schneider, J., and Ferdinand, C. 1999. Pipeline behaviour prediction for superscalar processors by abstract interpretation. Languages, Compilers, and Tools for Embedded Systems.

  • Zhang, N. N., Burns, A., and Nicholson, M. 1993. Pipelined processors and worst case execution times. J. Real Time Systems 5(4).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burns, F., Koelmans, A. & Yakovlev, A. WCET Analysis of Superscalar Processors Using Simulation With Coloured Petri Nets. Real-Time Systems 18, 275–288 (2000). https://doi.org/10.1023/A:1008101416758

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008101416758

Navigation