Abstract
In this paper we present a new technique for performance modelling and a tool supporting this approach. Performance Evaluation Process Algebra (PEPA) [1] is an algebraic language which can be used to build models of computer systems which capture information about the performance of the system. The PEPA language serves two purposes as a formal description language for computer system models. The performance-related information in the model may be used to predict the performance of the system whereas the behavioural information in the model may be exploited when reasoning about the functional behaviour of the system (e.g. when finding deadlocks or when exhibiting equivalences between sub-components). In this paper we concentrate on the performance aspects of the language.
A method of reasoning about PEPA models proceeds by considering the derivation graph obtained from the model using the underlying operational semantics of the PEPA language. The derivation graph is systematically reduced to a form where it can be treated as the state transition diagram of the underlying stochastic (in fact, Markovian) process. From this can be obtained the infinitesimal generator matrix of the Markov process. A steady state probability distribution for the system can then be obtained, if it exists.
We have implemented a prototype tool which supports this methodology from the initial checking of the well-formedness of the PEPA model through the creation of the state transition diagrams to the calculation of performance measures based on the infinitesimal generator matrix. The tool is implemented in Standard ML [2] and provides an interface to the Maple Symbolic Algebra package [3] for the solution of matrix equations.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Hillston. PEPA — Performance Enhanced Process Algebra. Technical report, Dept. of Computer Science, University of Edinburgh, March 1993.
R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. The MIT Press, 1990.
B.W. Char, K.O. Geddes, G.H. Gonnet, M.B. Monagan, and S.M.Watt. Maple Reference Manual. 1988.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
N. Götz, U. Herzog, and M. Rettelbach. Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis using Stochastic Process Algebras. In Performance'93, 1993.
J. Hillston. A Compositional Approach to Performance Modelling. PhD thesis, Department of Computer Science, University of Edinburgh, 1994. to appear.
I.S.O. LOTOS: A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. IS 8807, TC97/SC21, 1989.
C.J. Koomen. The Design of Communicating Systems: A System Engineering Approach. Kluwer, 1991.
F. Moller and C. Tofts. A Temporal Calculus for Communicating Systems. In J.C.M. Baeten and J.W. Klop, editors, CONCUR'90, volume 458 of LNCS, pages 401–415. August 1989.
X. Nicollin and J. Stifakis. An Overview and Synthesis on Timed Process Algebras. In Real-Time: Theory in Practice, pages 526–548. Springer LNCS 600, 1991.
J. Davies and S. Schneider. A Brief History of Timed CSP. Technical report, Programming Research Group, Oxford University, Oxford OX1 3QD, September 1992.
B. Strulo. Process Algebra for Discrete Event Simulation. PhD thesis, Imperial College, 1993. to appear.
M. Ajmone Marsan, G. Conte, and G. Balbo. A Class of Generalised Stochastic Petri Nets for the Performance Evaluation of Multiprocessor Systems. ACM Transactions on Computer Systems, 2(2):93–122, May 1984.
N. Götz, U. Herzog, and M. Rettelbach. TIPP—a language for timed processes and performance evaluation. Technical Report 4/92, IMMD7, University of Erlangen-Nürnberg, Germany, November 1992.
J.K. Muppala and K.S. Trivedi. Composite Performance and Availability Analysis Using a Hierarchy of Stochastic Reward Nets. In G. Balbo and G. Serazzi, editors, Computer Performance Evaluation: Modelling Techniques and Tools, pages 335–349. Elsevier, February 1991.
R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semanticsbased tool for the verification of concurrent systems. ACM Transcations on Programming Languages and Systems, 15(1):36–72, January 1993.
W.H. Burge. Recursive Programming Techniques. Addison-Wesley, 1975.
H. Takagi. Queueing Analysis of Polling Models: An Update. In H. Takagi, editor, Stochastic Analysis of Computer and Communication Systems, pages 267–318. IFIP, 1990.
M. Ajmone Marsan, S. Donatelli, and F. Neri. GSPN Models of Markovian Multiserver Multiqueue Systems. Performance Evaluation, 11:227–240, 1990.
Q. Yang, D. Ghosal, and L. Bhuyan. Performance Analysis of Multiple Token Ring and Multiple Slotted Ring Networks. In Proceedings of Computer Network Symposium, pages 79–86, Washington DC, 1986. IEEE.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gilmore, S., Hillston, J. (1994). The PEPA workbench: A tool to support a process algebra-based approach to performance modelling. In: Haring, G., Kotsis, G. (eds) Computer Performance Evaluation Modelling Techniques and Tools. TOOLS 1994. Lecture Notes in Computer Science, vol 794. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58021-2_20
Download citation
DOI: https://doi.org/10.1007/3-540-58021-2_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58021-8
Online ISBN: 978-3-540-48416-5
eBook Packages: Springer Book Archive