Finding a way to specify complex performance queries on models of systems in a way that is both accessible and expressive is a major challenge in performance analysis. This paper describes our attempts to address this challenge through the development of Performance Trees, a formalism for the graphical specification of complex performance queries on stochastic models. Performance Trees are designed to be accessible by providing more intuitive query specification, expressive by being able to reason about a broader range of concepts than current alternatives, extensible by supporting additional user-defined concepts, and versatile through their applicability to multiple modelling formalisms.
Tool support is implemented in the form of a module for the PIPE2 Petri net tool, which provides Performance Tree query design capabilities through both a graphical user interface and a natural language query builder. Query evaluation is supported by a set of integrated parallel and distributed analysis tools, which are hosted on a dedicated cluster. The application of Performance Trees is demonstrated in the context of a case study of an online transaction system. We also illustrate their flexibility with extensions that permit the specification and monitoring of Service Level Agreements.
Presented as an invited lecture at PARENG'09, the 1st International Conference on Parallel, Distributed and Grid Computing for Engineering. Details: http://www.saxe-coburg.co.uk/pubs/descrip/pengle09.htm
pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.