METRICS

This tutorial will present techniques for modeling the performance of I/O subsystems that incorporate channels, control units, string controllers and direct access devices. The presentation will focus on the general principles involved in analyses of ...

Workload characterization is that branch of performance evaluation which concerns itself with the measurement and modeling of the workloads to be processed by the system being evaluated. Since all performance indices of interest are workload-dependent, ...

This tutorial is an introduction to performance modeling in the design of integrated circuits (ICs). It assumes no background in either electrical engineering or VLSI design; all relevant concepts and terminology will be introduced. The goal is to give ...

There are a number of views as to what software reliability is and how it should be quantified. Some people believe that this measure should be binary in nature so that an imperfect program would have zero reliability while a perfect one would have a ...

This tutorial addresses performance problems in Local Area Networks (LAN). User level performance measures are affected both by the software as well as communication bottlenecks. Techniques for modeling the key components of the performance of a LAN ...

A great portion of the formal practice called computer performance evaluation is the application of rules of thumb and proceduralized analysis of model results, specific reports, and data elements based on the experience and knowledge of the ...

This paper develops an analytical model for a cache-reload transient. When an interrupt program or system program runs periodically in a cache-based computer, a short cache-reload transient occurs each time the interrupt program is invoked. That ...

We use an exact analytical technique, based on Generalized Timed Petri Nets (GTPNs), to study the performance of shared bus cache consistency protocols for multiprocessors. We develop a general framework within which the key characteristics of the Write-...

In this paper we describe two types of complex server aggregations which can be used to model collections of components in certain types of parallel computer systems and give a case study showing how the aggregations may be applied in practice. ...

A performance analysis methodology using certain aspects of queueing theory to evaluate computer system speed performance is presented. This methodology specifically focuses on modeling multiprocessor computer systems with unbalanced flows (i.e., number ...

A class of arbiters, known as batching arbiters, is introduced and defined. A particularly simple decentralised example of a batching arbiter is described, with motivation given for the batching arbiter model adopted. It is shown that under reasonable ...

When periodic tasks with hard deadlines communicate over a bus, the problem of hard real-time bus scheduling arises. This paper addresses several problems of hard real-time bus scheduling, including the evaluation of scheduling algorithms and the issues ...

Dynamic load balancing in a system of loosely-coupled homogeneous processors may employ both judicious initial placement of processes and migration of existing processes to processors with fewer resident processes. In order to predict the possible ...

Load balancing policies in distributed systems divide jobs into two classes; those processed at their of origination (local jobs) and those processed at some other site in the system after being transfered through a communication network (remote jobs). ...

We consider a multiclass service station with B identical exponential servers, with constant service rate μ. At a station, the classes of customers are sorted into M concurrent groups ; the discipline of service is on a first come first served basis, ...

The class of product-form semi-homogeneous queueing networks is introduced as a generalization of the class of homogeneous networks, which has been considered by Balbo et al for the performance modeling of local area networks. In semi-homogeneous ...

Considered are optimal dynamic policies for multiplexing Κ + 1 heterogeneous traffic types onto a single communication channel. The packet types arrive to the channel according to independent Poisson processes. The service requirements are exponential ...

Communication technology now makes it possible to support high data transmission rates at relatively low cost. In particular, optical fiber can be used as the medium in local area networks with data rates in the range of 100 megabits per second. ...

We introduce the concept of approximate disaggregation which enables us to replace a station by a subnetwork, i.e. a set of stations, such that the performance of the derived network is close to the performance of the initial network. We use this ...

Closed product-form queueing networks are considered. Recursive schemata are proposed for the higher moments of the number of customers in the queues, called “moment analysis”. As with mean value analysis (MVA), in general no state probabilities are ...

In Gray, Homan, Obermarck, and Korth [GHOK], the authors give many conjectures based on simulation for the probabilistic analysis of transaction lock-waits and transaction deadlocks. In this paper, we introduce a probabilistic model to explain their ...

In this paper we present a new analytical model for performance measurements of timestamp driven databases. The model is based on two-dimensional Poisson processes where one coordinate represents the real arrival time and the other the timestamp of an ...

In this paper, we analyze the performance of a concurrency control algorithm for replicated database systems. We present a model of a distributed database system which provides a framework to study the performance of different concurrency control ...

In models of virtual memory computer systems, it is generally assumed that the time intervals between the page (or segment) faults, often called lifetimes, are independent from each other. Due to the phase-transition behaviour in many real programs this ...

Recent research has demonstrated the existence of locality in short-term file referencing behaviour. A detailed study of the dynamic characteristics of file referencing is presented in this paper. The concept of Bounded Locality Intervals from the field ...

The use of micro-processors and commercial operating systems in real-time applications demands a good understanding of factors which influence software performance. Advances in micro-processor design (e.g. pipelining) make performance prediction based ...

Queueing models provide a useful tool for predicting the performance of many service systems including computer systems, telecommunication systems, computer/communication networks and flexible manufacturing systems. Traditional queueing models predict ...

In a flexible manufacturing system stations are arranged along a common conveyor that brings items for processing to the stations and also carries away the processed items. At each station specialized robots automatically load and unload items on and ...

A new “hybrid” analytic framework, based on the principle of maximum entropy, is used to approximate the queue length distribution of a G/G/1 finite buffer queue. Robust recursive relations are derived and asymptotic connections to the infinite capacity ...

Analysis is given to a nonpreemptive priority queueing system with P classes of messages where the class of message to be served next is the highest priority class waiting at the time of service start. (If this were the highest priority class waiting at ...