Abstract
The performance analysis of parallel systems which are synchronised is an important but challenging task. This is because product form solutions are not available when synchronisation is required. The system of interest is a controlled fork-join network, comprising two parallel processes. Each process is governed by an exponentially distributed delay. The system has a capacity, N, which cannot be exceeded. Thus only N requests for service can be handled concurrently, so that further requests are blocked. The arrival of requests is also governed by an exponential distribution. We model this class of system with a Generalized Stochastic Petri Net (GSPN) which includes a two branch fork-join structure controlled by an environment that enforces the capacity constraint. This GSPN is thus parameterised by the capacity, N. We derive the parametric reduced reachability graph for arbitrary N, and show that it has (Nā+ā1)2 markings and one strongly connected component. We also prove that the GSPN is bounded by N, and thus show that one process cannot lead the other by more than N. We obtain the associated family of continuous time Markov chains, and derive the family of global balance equations for arbitrary N. We solve these equations for the steady state probabilities for N = 1 and 2, and then present a theorem for the general form of the solution for arbitrary Nā>ā2 in terms of ratios of polynomials in the transition rates. A scheme of 21 relationships between these polynomials is also obtained. Finally we explore some asymptotic behaviour of the steady state probabilities and relate them to previously obtained closed form approximate solutions.
Supported by Australian Research Council Discovery Project Grant DP0880928.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajmone Marsan, M., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G.: Modelling with Generalized Stochastic Petri Nets. John Wiley and Sons, Chichester (1995)
Baccelli, F., Massey, W.A., Towsley, D.: Acyclic fork-join queuing networks. Journal of the ACMĀ 36(3), 615ā642 (1989)
Bause, F., Kritzinger, P.S.: Stochastic Petri Nets - An Introduction to the Theory, 2nd edn. Vieweg-Verlag (2002)
Billington, J., Gallasch, G.E.: Closed Form Approximations for Steady State Probabilities of a Controlled Fork-Join Network. In: Dong, J.S., Zhu, H. (eds.) ICFEM 2010. LNCS, vol.Ā 6447, pp. 420ā435. Springer, Heidelberg (2010)
Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, vol.Ā 40. Cambridge University Press, Cambridge (1995)
Flatto, L.: Two Parallel Queues Created by Arrivals with Two Demands II. SIAM Journal of Applied MathematicsĀ 45, 861ā878 (1985)
Flatto, L., Hahn, S.: Two Parallel Queues Created by Arrivals with Two Demands I. SIAM Journal of Applied MathematicsĀ 44, 1041ā1053 (1984)
Freiheit, J., Billington, J.: New Developments in Closed-Form Computation for GSPN Aggregation. In: Dong, J.S., Woodcock, J. (eds.) ICFEM 2003. LNCS, vol.Ā 2885, pp. 471ā490. Springer, Heidelberg (2003)
Gallasch, G.E., Billington, J.: A Study of the Convergence of Steady State Probabilities in a Closed Fork-Join Network. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol.Ā 6252, pp. 143ā157. Springer, Heidelberg (2010)
Gallasch, G.E., Billington, J.: Exploring Parametric Representation and Aggregation of Closed Fork-Join Subnets. Tech. Rep. CSEC-40, Computer Systems Engineering Centre Report Series, University of South Australia (March 2010)
Harrison, P., Zertal, S.: Queueing models of RAID systems with maxima of waiting times. Performance EvaluationĀ 64, 664ā689 (2007)
Kim, C., Agrawala, A.K.: Analysis of the Fork-Join Queue. IEEE Transactions on ComputersĀ 38(2), 250ā255 (1989)
Lilith, N., Billington, J., Freiheit, J.: Approximate Closed-Form Aggregation of a Fork-Join Structure in Generalised Stochastic Petri Nets. In: Proc. 1st Int. Conference on Performance Evaluation Methodologies and Tools. International Conference Proceedings Series, vol.Ā 180, p. 10. ACM Press, New York (2006)
Liu, Y.C., Perros, H.G.: A Decomposition Procedure for the Analysis of a Closed Fork/Join Queueing System. IEEE Transactions on ComputersĀ 40(3), 365ā370 (1991)
Lui, J.C.S., Muntz, R.R., Towsley, D.: Computing Performance Bounds of Fork-Join Parallel Programs under a Multiprocessing Environment. IEEE Transactions on Parallel and Distributed SystemsĀ 9(3), 295ā311 (1998)
Makowski, A., Varma, S.: Interpolation Approximations for Symmetric Fork-Join Queues. Performance EvaluationĀ 20, 145ā165 (1994)
Murata, T.: Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEEĀ 77(4), 541ā580 (1989)
Neale, G.: On Performance Analysis of On-Demand Parallel Manufacturing Systems Modelled by Generalised Stochastic Petri Nets. Honours thesis, University of South Australia, School of Electrical and Information Engineering (2010)
Nelson, R., Tantawi, A.N.: Approximate Analysis of Fork/Join Synchronization in Parallel Queues. IEEE Transactions on ComputersĀ 37(6), 739ā743 (1988)
Nelson, R., Towsley, D., Tantawi, A.N.: Performance Analysis of Parallel Processing Systems. IEEE Transactions on Software EngineeringĀ 14(4), 532ā540 (1988)
Varki, E.: Mean value technique for closed fork-join networks. In: SIGMETRICS 1999: Proceedings of the 1999 ACM SIGMETRICS International Conference on Measurement and Modeling Of Computer Systems, pp. 103ā112 (1999)
Varki, E.: Response Time Analysis of Parallel Computer and Storage Systems. IEEE Transactions on Parallel and Distributed SystemsĀ 12(11), 1146ā1161 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Billington, J., Gallasch, G.E. (2011). On Parametric Steady State Analysis of a Generalized Stochastic Petri Net with a Fork-Join Subnet. In: Kristensen, L.M., Petrucci, L. (eds) Applications and Theory of Petri Nets. PETRI NETS 2011. Lecture Notes in Computer Science, vol 6709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21834-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-21834-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21833-0
Online ISBN: 978-3-642-21834-7
eBook Packages: Computer ScienceComputer Science (R0)