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.
This work has been supported by the European Community’s Seventh Framework Programme under project DISC (Grant Agreement n.INFSO-ICT-224498) and by the project FORMALISM (TIN2007-66523).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ramamoorthy, C.V., Ho, G.S.: Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets. IEEE Trans. Softw. Eng. 6(5), 440–449 (1980)
Burns, S.M.: Performance Analysis and Optimization of Asynchronous Circuits. PhD thesis, Pasadena, CA, USA (1991)
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)
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)
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)
Greenstreet, M.R., Steiglitz, K.: Bubbles Can Make Self-Timed Pipelines Fast. VLSI Signal Processing 2(3), 139–148 (1990)
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)
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)
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)
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)
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)
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)
Silva, M.: Introducing Petri Nets. In: Practice of Petri Nets in Manufacturing, pp. 1–62. Chapman & Hall, Boca Raton (1993)
Murata, T.: Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE 77, 541–580 (1989)
Florin, G., Natkin, S.: Necessary and Sufficient Ergodicity Condition for Open Synchronized Queueing Networks. IEEE Trans. Softw. Eng. 15(4), 367–380 (1989)
Little, J.D.C.: A Proof for the Queuing Formula: L= λ W. Operations Research 9(3), 383–387 (1961)
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)
Ramchandani, C.: Analysis of Asynchronous Concurrent Systems by Petri Nets. PhD thesis, Cambridge, MA, USA (1974)
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)
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)
Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms. McGraw-Hill Higher Education, New York (2001)
The MathWorks: Matlab (2008), http://www.mathworks.com/ (version R2008a)
University of Torino: The GreatSPN tool (2002), http://www.di.unitorino.it/~greatspn
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rodríguez, R.J., Júlvez, J. (2010). Accurate Performance Estimation for Stochastic Marked Graphs by Bottleneck Regrowing. In: Aldini, A., Bernardo, M., Bononi, L., Cortellessa, V. (eds) Computer Performance Engineering. EPEW 2010. Lecture Notes in Computer Science, vol 6342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15784-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-15784-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15783-7
Online ISBN: 978-3-642-15784-4
eBook Packages: Computer ScienceComputer Science (R0)