Performance Engineering and Stochastic Modelling

Performance engineering has become a central plank in the design of complex, time-critical systems. It is supported by stochastic modelling, a brief history of which is given, going back to Erlang as long ago as 1909. This in turn developed according to successive new generations of communication and computer architectures and other operational systems. Its evolution through queues and networks is reviewed, culminating in the unification of many specification and solution techniques in a common formalism, stochastic process algebra. Recent results are given on the automatic computation of separable solutions for the equilibrium state probabilities in systems specified in such a formalism. A performance engineering support environment is proposed to integrate these methods with others such as response time analysis and fluid models, which are better suited to large scale aggregation of similar components in a continuous space.

[1]  Michael Pinedo,et al.  Queueing networks - customers, signals and product form solutions , 1999, Wiley-Interscience series in systems and optimization.

[2]  C. Murray Woodside,et al.  A Metamodel for Generating Performance Models from UML Designs , 2004, UML.

[3]  Jane Hillston,et al.  Product Form Solution for a Class of PEPA Models , 1999, Perform. Evaluation.

[4]  Peter G. Harrison,et al.  Reversed processes, product forms and a non-product form☆ , 2004 .

[5]  Ramon Puigjaner,et al.  Computer Performance Evaluation , 2000, Lecture Notes in Computer Science.

[6]  Roberto Gorrieri,et al.  Integrating Performance and Functional Analysis of Concurrent Systems with EMPA , 1995 .

[7]  Peter G. Harrison,et al.  Separable equilibrium state probabilities via time reversal in Markovian process algebra , 2005, Theor. Comput. Sci..

[8]  James R. Jackson,et al.  Jobshop-Like Queueing Systems , 2004, Manag. Sci..

[9]  E. Gelenbe.  G-networks by triggered customer movement , 1993 .

[10]  Erol Gelenbe,et al.  Stability of Product Form G-Networks , 1992 .

[11]  W. J. Gordon,et al.  Closed Queuing Systems with Exponential Servers , 1967, Oper. Res..

[12]  Erol Gelenbe.  The first decade of G-networks , 2000, Eur. J. Oper. Res..

[13]  Holger Hermanns,et al.  Formal Characterisation of Immediate Actions in SPA with Nondeterministic Branching , 1995, Comput. J..

[14]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

[15]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[16]  Valeriy Naumov,et al.  The life and work of A.A. Markov , 2004 .

[17]  Tony Field,et al.  Experimental Evaluation of the UML Profile for Schedulability, Performance, and Time , 2004, UML.

[18]  Richard J. Boucherie.  A Characterization of Independence for Competing Markov Chains with Applications to Stochastic Petri Nets , 1994, IEEE Trans. Software Eng..

[19]  Peter G. Harrison,et al.  Turning back time in Markovian process algebra , 2003, Theor. Comput. Sci..

[20]  Rob Pooley,et al.  Derivation of Petri Net Performance Models from UML Specifications of Communications Software , 2000, Computer Performance Evaluation / TOOLS.

[21]  Peter G. Harrison.  Compositional reversed Markov processes, with applications to G-networks , 2004, Perform. Evaluation.

[22]  Erol Gelenbe,et al.  Random Neural Networks with Negative and Positive Signals and Product Form Solution , 1989, Neural Computation.

[23]  A. K. Erlang.  The theory of probabilities and telephone conversations , 1909 .

[24]  Erol Gelenbe,et al.  G-Networks with resets , 2002 .

[25]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[26]  K. Banasiewicz.  Economic and organizational effects of different legal and organizational forms of enterprises , 2006 .