Analysis of a general Markovian two-stage continuous-flow production system with a finite buffer

2017 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS)

Queuing networks models are widely used as important tools for the performance modeling and evaluation of both computer systems and communication networks. Exact solutions are generally not attainable except for some special cases. Consequently, numerical techniques and analytic approximations are needed for the study of queuing networks with bursty traffic. This paper presents the performance modeling and evaluation of general packet radio service (GPRS) for wireless global system for mobile telecommunication (GSM) cells with bursty multi-class traffic under a partial sharing scheme (PSS). The model has been developed using a new powerful tool, MOSEL (Modeling, specification and evaluation language), which is based on numerical methods and the Petri-nets. The proposed model has been validated against simulation and those developed using maximum entry (ME), a well established methodology for approximate solutions. Numerical results demonstrate the credibility of our models.

Matrix geometric solutions in M/G/1 type Markov chains with multiple boundaries: A generalized state-space approach

Dynamic network models are widely employed for system analysis and performance evaluation of computer and communication systems. In dynamic networks each arc is weighted with a capacity and a transit time. The former is the maximum amount of flow that can travel through the arc per unit time, the later is the time period needed for flow to travel through the arc. In this article, an additional weight operation probability, is assigned to each arc to note the capability of the arc's successful transition. The performance of dynamic networks is defined by the probability that the maximum dynamic flow from source to sink within required time horizon is no less than specified threshold. To the best of our knowledge, no existing article had considered dynamic flow and network reliability simultaneously. Based on facts that there is always a maximum dynamic flow among the temporally repeated flows and the maximum temporally repeated flow can be obtained via an equivalent minimum cost maximum flow problem, we present a pioneering algorithm to compute performance of dynamic networks by solving minimum cost maximum flow and two-terminal capacity reliability at the same time.

In the framework of the workshop “Performance Evaluation of Computer and Communication Systems: Milestones and Future Challenges”, this paper proposes to address the emerging criteria of energy. Used since a long time in embedded systems where battery operated devices needed a careful handling, the energy metric is taking a large momentum in the last years on large scale systems where thousands of nodes collaborate to serve high end infrastructures like web servers, clouds and grids.KeywordsService Level AgreementTask AllocationLarge Scale SystemCluster WorkshopDynamic Voltage Frequency ScalingThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

2019 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS)

2018 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS)

Stochastic Petri nets (SPNs) are widely used for the performance evaluation of computer and telecommunication systems. They inherit from their untimed version the capability of modeling parallel computations in a simple, graphical way. Simulation of SPNs is an important way to assess the performance of a system measured as throughput, response time or expected number of customers/resources in some places. Perfect sampling allows for the selection of the initial state of a simulation with a probability which corresponds to its stationary probability and hence the warm-up period is not required any more. In this paper we present performance tests of spnps, a tool based on some previous works that implements perfect sampling algorithm for SPNs by using decision diagrams. We test performance of the tool on a class of stochastic models of great importance in the quantitative evaluation of distributed systems and communication networks: the fork-join queueing networks.

The incorporation of time into classical process algebras aiming at the integration of functional design and performance analysis has become very popular recently. There are many ways to include time in process algebras. Current research in this area concentrates mainly on the annotation of actions with exponentially distributed random variables. This allows us to make use of a large repertoire of analysis algorithms. This paper presents some first results of ongoing work which aims at providing a tool for the efficient performance evaluation and functional analysis of computer and communication systems based on the stochastic process algebra paradigm. It provides facilities for model creation, reachability analysis, as well as several numerical algorithms for the solution of the underlying Markov chain and the computation of characteristic performance measures.

The 8th International Workshop on Performance Modeling, Evaluation, and Optimization of Ubiquitous Computing and Networked Systems (PMEO-UCNS'09)

Java Modelling Tools (JMT) is a suite of open source applications for performance evaluation and workload characterization of computer and communication systems based on queueing networks. JMT includes tools for workload characterization (JWAT), solution of queueing networks with analytical algorithms (JMVA), simulation of general-purpose queueing models (JSIM), bottleneck identification (JABA), and teaching support for Markov chain models underlying queueing systems (JMCH). This tutorial summarizes the main features of the tools that compose the suite. Furthermore, using a composite case study, we provide intuition on the versatility of JMT in dealing with the different aspects of quality-of-service (QoS) evaluation, what-if analysis, and software performance tuning.

Welcome to PMEO-UCNS'10! This is the 9 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">th</sup> International Workshop on Performance Modeling, Evaluation, and Optimization of Ubiquitous Computing and Networked Systems is being held in conjunction with IPDPS'10.

A proper evaluation of techniques that require multiple training and evaluation executions of a benchmark, such as Feedback-Directed Optimization (FDO), requires multiple workloads that can be used to characterize variations on the behaviour of a program based on the workload. This paper aims to improve the performance evaluation of computer systems — including compilers, computer architecture simulation, and operating-system prototypes — that rely on the industrystandard SPEC CPU benchmark suite. A main concern with the use of this suite in research is that it is distributed with a very small number of workloads. This paper describes the process to create additional workloads for this suite and offers useful insights in many of its benchmarks. The set of additional workloads created, named the Alberta Workloads for the SPEC CPU 2017 Benchmark Suite1 is made freely available with the goal of providing additional data points for the exploration of learning in computing systems. These workloads should also contribute to ameliorate the hidden learning problem where a researcher sets parameters to a system during development based on a set of benchmarks and then evaluates the system using the very same set of benchmarks with the very same workloads.

We describe a quantitative model for the performance evaluation of interactive computer systems. The approach involves the development of an interaction graph or state transition diagram to describe the user-machine interaction. Given numerical data on transition times and probabilities, the model can be used to perform sensitivity analyses of changes in system parameters and user behavior. To illustrate the model, we use empirical data from field and laboratory experiments designed to compare a prototype natural language query system with a formal (relational) query system. The general approach is applicable in a broad range of other contexts including bibliographic retrieval and the analysis of web-log data. It should be of interest to both system developers and potential users of these systems.

Two interrelated sessions will address the technology of computer system performance measurement and evaluation from both the point of view of a user (computer management) and the point of view of the developer of methodologies. The first session will deal with various uses of monitoring devices and data in improving the efficiency and effectiveness of a computer installation, as practiced in operating computer centers today.In the second session, recent methodological developments and their implications for performance evaluation will be described. Following the second session, a panel of speakers from both sessions will discuss the major problems and potentials of performance measurement with a view toward future directions. During the panel discussion emphasis will be on interaction with the audience.