Advertisement

Accurate Performance Estimation for Stochastic Marked Graphs by Bottleneck Regrowing

  • Ricardo J. Rodríguez
  • Jorge Júlvez
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6342)

Abstract

The adequate system performance is usually a critical requirement to be checked during the verification phase of a system. Thus, accurately measuring the performance of current industrial systems, which are often modelled as a Discrete Event Systems (DES), is a need. Due to the state explosion problem, the performance evaluation of DES becomes increasingly difficult as the size of the systems increases. Some approaches, such as the computation of performance bounds, have been developed to overcome this problem. In this paper we propose a new method to produce performance bounds that are sharper than the ones that can be achieved with current methods. The core of our method is an iterative algorithm that initially considers the most constraining bottleneck cycle of the system and adds other cycles to it in each iteration. The proposed method is deeply explained and then applied to a broad set of Marked Graphs.

Keywords

Linear Programming Problem Discrete Event System Average Residence Time Server Semantic Marked Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ramamoorthy, C.V., Ho, G.S.: Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets. IEEE Trans. Softw. Eng. 6(5), 440–449 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Burns, S.M.: Performance Analysis and Optimization of Asynchronous Circuits. PhD thesis, Pasadena, CA, USA (1991)Google Scholar
  3. 3.
    Kudva, P., Gopalakrishnan, G., Brunvand, E., Akella, V.: Performance analysis and optimization of asynchronous circuits. In: ICCD, pp. 221–224. IEEE Computer Society, Los Alamitos (1994)Google Scholar
  4. 4.
    Xie, A., Beerel, P.A.: Symbolic Techniques for Performance Analysis of Timed Systems Based on Average Time Separation of Events. In: ASYNC, pp. 64–75. IEEE Computer Society, Los Alamitos (1997)Google Scholar
  5. 5.
    Xie, A., Beerel, P.A.: Accelerating Markovian Analysis of Asynchronous Systems using String- based State Compression. In: ASYNC, pp. 247–260. IEEE Computer Society, Los Alamitos (1998)Google Scholar
  6. 6.
    Greenstreet, M.R., Steiglitz, K.: Bubbles Can Make Self-Timed Pipelines Fast. VLSI Signal Processing 2(3), 139–148 (1990)CrossRefGoogle Scholar
  7. 7.
    Campos, J., Chiola, G., Colom, J., Silva, M.: Properties and Performance Bounds for Timed Marked Graphs. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications 39(5), 386–401 (1992)CrossRefzbMATHGoogle Scholar
  8. 8.
    Chiola, G., Anglano, C., Campos, J., Colom, J., Silva, M.: Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds. In: Proceedings of the 5th International Workshop on Petri Nets and Performance Models, Toulouse, France, pp. 128–137. IEEE Computer Society Press, Los Alamitos (1993)CrossRefGoogle Scholar
  9. 9.
    Liu, Z.: Performance Bounds for Stochastic Timed Petri Nets. In: Proceedings of the 16th International Conference on Application and Theory of Petri Nets, London, UK, pp. 316–334. Springer, Heidelberg (1995)Google Scholar
  10. 10.
    Xie, A., Kim, S., Beerel, P.A.: Bounding Average Time Separations of Events in Stochastic Timed Petri Nets with Choice. In: ASYNC 1999: Proceedings of the 5th International Symposium on Advanced Research in Asynchronous Circuits and Systems, Washington, DC, USA, pp. 94–107. IEEE Computer Society, Los Alamitos (1999)Google Scholar
  11. 11.
    Bernardi, S., Campos, J.: Computation of Performance Bounds for Real-Time Systems Using Time Petri Nets. IEEE Transactions on Industrial Informatics 5(2), 168–180 (2009)CrossRefGoogle Scholar
  12. 12.
    Brglez, F., Bryan, D., Kozminski, K.: Combinational Profiles of Sequential Benchmark Circuits. In: IEEE International Symposium on Circuits and Systems, vol. 3, pp. 1929–1934 (1989)Google Scholar
  13. 13.
    Silva, M.: Introducing Petri Nets. In: Practice of Petri Nets in Manufacturing, pp. 1–62. Chapman & Hall, Boca Raton (1993)CrossRefGoogle Scholar
  14. 14.
    Murata, T.: Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE 77, 541–580 (1989)CrossRefGoogle Scholar
  15. 15.
    Florin, G., Natkin, S.: Necessary and Sufficient Ergodicity Condition for Open Synchronized Queueing Networks. IEEE Trans. Softw. Eng. 15(4), 367–380 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Little, J.D.C.: A Proof for the Queuing Formula: L= λ W. Operations Research 9(3), 383–387 (1961)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Campos, J., Silva, M.: Structural Techniques and Performance Bounds of Stochastic Petri Net Models. In: Rozenberg, G. (ed.) APN 1992. LNCS, vol. 609, pp. 352–391. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  18. 18.
    Ramchandani, C.: Analysis of Asynchronous Concurrent Systems by Petri Nets. PhD thesis, Cambridge, MA, USA (1974)Google Scholar
  19. 19.
    Campos, J.: Performance Bounds. In: Balbo, G., Silva, M. (eds.) Performance Models for Discrete Event Systems with Synchronizations: Formalisms and Analysis Techniques, Editorial KRONOS, Zaragoza, Spain, pp. 587–635 (1998)Google Scholar
  20. 20.
    Carmona, J., Júlvez, J., Cortadella, J., Kishinevsky, M.: Scheduling Synchronous Elastic Designs. In: Proceedings of the 2009 Application of Concurrency to System Design conference (ACSD 2009), Augsburg, Germany (2009)Google Scholar
  21. 21.
    Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms. McGraw-Hill Higher Education, New York (2001)zbMATHGoogle Scholar
  22. 22.
    The MathWorks: Matlab (2008), http://www.mathworks.com/ (version R2008a)
  23. 23.
    University of Torino: The GreatSPN tool (2002), http://www.di.unitorino.it/~greatspn
  24. 24.
    Ajmone Marsan, M., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G.: Modelling with Generalized Stochastic Petri Nets. Wiley Series in Parallel Computing. John Wiley and Sons, Chichester (1995)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Ricardo J. Rodríguez
    • 1
  • Jorge Júlvez
    • 1
  1. 1.Dpto. de Informática e Ingeniería de SistemasUniversidad de ZaragozaZaragozaSpain

Personalised recommendations