Relating layered queueing networks and process algebra models

Authors:
Mirco Tribastone
Affiliations:
The University of Edinburgh, Edinburgh, Scotland, UK
Venue:
Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering
Year:
2010

Citing 17
Cited 1

A Clustering Approximation Technique for Queueing Network Models with a Large Number of Chains

IEEE Transactions on Computers
Throughput calculation for basic stochastic rendezvous networks

Performance Evaluation
A compositional approach to performance modelling

A compositional approach to performance modelling
A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time

Theoretical Computer Science
Mean-Value Analysis of Closed Multichain Queuing Networks

Journal of the ACM (JACM)
Linearizer: a heuristic algorithm for queueing network models of computing systems

Communications of the ACM
Communicating sequential processes

Communications of the ACM
An Efficient Algorithm for Aggregating PEPA Models

IEEE Transactions on Software Engineering
Performance validation tools for software/hardware systems

Performance Evaluation
A Calculus of Communicating Systems

A Calculus of Communicating Systems
The Method of Layers

IEEE Transactions on Software Engineering
Expressing performance requirements using regular expressions to specify stochastic probes over process algebra models

WOSP '04 Proceedings of the 4th international workshop on Software and performance
Fluid Flow Approximation of PEPA models

QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Automatic extraction of PEPA performance models from UML activity diagrams annotated with the MARTE profile

WOSP '08 Proceedings of the 7th international workshop on Software and performance
Enhanced Modeling and Solution of Layered Queueing Networks

IEEE Transactions on Software Engineering
The PEPA eclipse plugin

ACM SIGMETRICS Performance Evaluation Review
Stochastic Simulation Methods Applied to a Secure Electronic Voting Model

Electronic Notes in Theoretical Computer Science (ENTCS)

Continuous approximation of collective system behaviour: A tutorial

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a process-algebraic interpretation of the Layered Queueing Network model. The semantics of layered multi-class servers, resource contention, multiplicity of threads and processors are mapped into a model described in the stochastic process algebra PEPA. The accuracy of the translation is validated through a case study of a distributed computer system and the numerical results are used to discuss the relative strengths and weaknesses of the different forms of analysis available in both approaches, i.e., simulation, mean-value analysis, and differential approximation.