Results 1  10
of
73
The Automatic Generation of Software Performance Models From a Prototype
 In International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS'95
, 1995
"... Early performance estimates for a new software system aid the design process by providing feedback when design decisions can be easily revised. Unfortunately, constructing a performance model of a distributed and concurrent software system can require significant effort. An automated performance mod ..."
Abstract

Cited by 30 (6 self)
 Add to MetaCart
Early performance estimates for a new software system aid the design process by providing feedback when design decisions can be easily revised. Unfortunately, constructing a performance model of a distributed and concurrent software system can require significant effort. An automated performance model generation technique is described that reduces the model building effort by providing: easy specification of performance experiments, empirical estimates for model parameters, automated model generation, and support for different types of models. A prototype is used to describe a software system, from which causal traces (angio traces) are recorded during execution. These traces are then processed into sequences of resource demands (workthreads), aggregated into system execution descriptions (workthread classes), and combined to generate a performance model. The technique can also be applied at other stages of the development process, including the redesign of existing software. Page ii...
A Toolset for Performance Engineering and Software Design of ClientServer Systems
 Performance Evaluation
, 1996
"... TimeBench/SRVN is a prototype toolset for computeraided design and performance analysis of software, with an emphasis on distributed clientserver systems. The performance behaviour of such systems may defy intuition because it involves factors in the software design (such as the partitioning of th ..."
Abstract

Cited by 29 (12 self)
 Add to MetaCart
TimeBench/SRVN is a prototype toolset for computeraided design and performance analysis of software, with an emphasis on distributed clientserver systems. The performance behaviour of such systems may defy intuition because it involves factors in the software design (such as the partitioning of the functionality and the frequency with which requests will be made to each server) and in the configuration of the distributed system (including replication of services, the distribution of data, and the speed of network access). The novelty of the tool consists in providing support both for developing design specifications and also for performance analysis. The integrated approach avoids the semantic gap between a designer's domain and the performance modeling domain, and assists the designer to explore factors that impact the performance of a design. The performance models are based on the Stochastic Rendezvous Network (SRVN) formalism for clientserver systems with synchronous service req...
TwoLevel Iterative Queuing Modeling of Software Contention
, 2002
"... Being able to model contention for software resources (e.g., a critical section or database lock) is paramount to building performance models that capture all aspects of the delay encountered by a process as it executes. Several methods have been offered for dealing with software contention and with ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
Being able to model contention for software resources (e.g., a critical section or database lock) is paramount to building performance models that capture all aspects of the delay encountered by a process as it executes. Several methods have been offered for dealing with software contention and with message blocking in clientserver systems. This paper presents a general, straightforward, easy to understand and implement, approach to modeling software contention using queuing networks. The approach, called SQNHQN, consists of a twolevel iterative process. Two queuing networks are considered: one represents software resources (SQN) and the other hardware resources (HQN). Multiclass models are allowed and any solution techniqueexact or approximatecan be used at any of the levels. This technique falls in the general category of fixedpoint approximate models and is similar in nature to other approaches. The main difference lies in its simplicity. The process converges very fast in the examples examined. The results were validated against global balance equation solutions and are very accurate.
On Performance Prediction of Parallel Computations with Precedent Constraints
, 1994
"... Performance analysis of concurrent executions in parallel systems has been recognized as a challenging problem. The aim of this research is to study approximate but ecient solution techniques for this problem. We model the structure of a parallel machine and the structure of the jobs executing on ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Performance analysis of concurrent executions in parallel systems has been recognized as a challenging problem. The aim of this research is to study approximate but ecient solution techniques for this problem. We model the structure of a parallel machine and the structure of the jobs executing on such a system. We investigate rich classes of jobs, which can be expressed by series, paralleland, parallelor, and probabilisticfork. We propose an efficient performance prediction method for these classes of jobs running on a parallel environment which is modeled by a standard queueing network model. The proposed prediction method is computationally efficient, it has polynomial complexity in both time and space. The time complexity is O(C²N²K) and the space complexity is O(C²N²K), where C is the number of job classes in the system, the number of tasks in each job class is O(N), and K is the number of service centers in the queueing model. The accuracy of the approxi...
A Tree Convolution Algorithm for the Solution of Queueing Networks
 Commun. ACM
, 1982
"... A new algorithm called the tree convolution algorithm for the computation of normalization constants and performance measures of productform queueing algorithms, in the solution of networks with many service centers and many sparse routing chains. (A network is said to have sparse routing chains ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
A new algorithm called the tree convolution algorithm for the computation of normalization constants and performance measures of productform queueing algorithms, in the solution of networks with many service centers and many sparse routing chains. (A network is said to have sparse routing chains if the chains visit, on the average, only a small fraction of all centers in the net work.) In such a network, substantial time and space savings can be achieved by exploiting the network's routing information. The time and space reductions are made possible by two features of the algorithm: (1) the sequence of array convolutions to compute a normalization constant is determined according to the traversal of a tree; and (2) the convolutions are performed between arrays that are smaller than arrays used by existing algorithms. The routing information of a given network is used to configure the tree to reduce the algorithms time and space requirements; some effective heuristics for optimization are de scribed herein. An exact solution of a communication network model with 64 queues and 32 routing chains is illustrated.
An Efficient Algorithm for the Exact Analysis of Multiclass Queueing Networks with Large Population Sizes
, 2006
"... We introduce an efficient algorithm for the exact analysis of closed multiclass productform queueing network models with large population sizes. We adopt a novel approach, based on linear systems of equations, which significantly reduces the cost of computing normalizing constants. With the propose ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
We introduce an efficient algorithm for the exact analysis of closed multiclass productform queueing network models with large population sizes. We adopt a novel approach, based on linear systems of equations, which significantly reduces the cost of computing normalizing constants. With the proposed algorithm, the analysis of a model with N circulating jobs of multiple classes requires essentially the solution of N linear systems with order independent of population sizes. A distinguishing feature of our approach is that we can immediately apply theorems, solution techniques, and decompositions for linear systems to queueing network analysis. Following this idea, we propose a block triangular form of the linear system that further reduces the requirements, in terms of both time and storage, of an exact analysis. An example illustrates the efficiency of the resulting algorithm in presence of large populations.
Mean Value Analysis for Queueing Network Models with Intervals as Input Parameters
, 1998
"... Mean value analysis (MVA) is a wellknown solution technique for separable closed queueing networks used in performance modeling of computer and communication systems. In many cases, like for sensitivity analysis or with inaccurate model input parameters, intervals are more appropriate as model inpu ..."
Abstract

Cited by 14 (12 self)
 Add to MetaCart
Mean value analysis (MVA) is a wellknown solution technique for separable closed queueing networks used in performance modeling of computer and communication systems. In many cases, like for sensitivity analysis or with inaccurate model input parameters, intervals are more appropriate as model inputs than single values. This paper presents a version of the MVA algorithm for separable closed queueing networks with one customer class consisting of loadindependent queueing centers as well as delay devices, which accepts both single values and intervals as input parameters in arbitrary combination. Monotonicity of the model outputs with respect to all input parameters is proved and these monotonicity properties are used to construct a low cost intervalversion of the MVA algorithm providing exact output intervals as results. Thus, dependency problems commonly arising with the interval evaluation of arithmetic expressions are avoided without significant increase in computation costs. Addit...
Bottlenecks Identification in Multiclass Queueing Networks using Convex Polytopes
, 2004
"... It is known that the resources that limit the overall performance of the system are the congested ones, referred to as bottlenecks. From the knowledge of the bottleneck stations with a limited computational effort it is possible to derive asymptotic values of several performance indices. While ident ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
It is known that the resources that limit the overall performance of the system are the congested ones, referred to as bottlenecks. From the knowledge of the bottleneck stations with a limited computational effort it is possible to derive asymptotic values of several performance indices. While identifying the bottleneck stations under a singleclass workload is a wellestablished practice, no simple methodology for multiclass models exists. In this paper we present new algorithms for identifying the bottlenecks in multiclass queueing networks with constantrate servers. We show how the application of assessed techniques, such as the ones related to the convex polytopes, can provide insights on the performance of a queueing network. The application of our techniques to the asymptotic analysis of closed productform networks is also investigated.
The MVA priority approximation
 ACM Transactions on Computer Systems
, 1984
"... A Mean Value Analysis (MVA) approximation is presented for computing the average performance measures of closed, open, and mixedtype multiclass queuing networks containing Preemptive Resume (PR) and nonpreemptive HeadOfLine (HOL) priority service centers. The approximation has essentially the s ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
A Mean Value Analysis (MVA) approximation is presented for computing the average performance measures of closed, open, and mixedtype multiclass queuing networks containing Preemptive Resume (PR) and nonpreemptive HeadOfLine (HOL) priority service centers. The approximation has essentially the same storage and computational requirements as MVA, thus allowing computationally efficient solutions of large priority queuing networks. The accuracy of the MVA approximation is systematically investigated and presented. It is shown that the approximation can compute the average performance measures of priority networks to within an accuracy of 5 percent for a large range of network parameter values. Accuracy of the method is shown to be superior to that of Sevcik's shadow approximation.