In this paper an approximation method is discussed for solving some special types of CPU-disk models by use of aggregation. The basic model is a closed queuing network model of a computer system. The model consists of several CPU's and disk units. Several types of clients are distinguished. The routing matrix for each type of client, however, restricts the clients to visit only one of the CPU's. The solution method discussed here, is based on the mean value analysis. Numerical experiments are used to show the accuracy of the proposed approximation method. Two types of examples are used here: the aggregation directly applied to the sketched computer model, and used in combination with the parametric analysis of a computer system in a termina...
This paper deals with a new approximation method for large scale queueing network models with multip...
Fork/join stations are used for modeling synchronization between entities, and fork/join queueing ne...
We consider mathematical models of multiprogrammed computer systems expressed in the form of closed ...
In this paper we study some aggregation methods for the analysis of closed queuing networks. The met...
The two primary issues in choosing a computing system model are credibility of the model and cost of...
In this paper we describe two types of complex server aggregations which can be used to model collec...
An approximate analytical method for estimating performance statistics of general closed queueing ne...
This paper deals with the problem of modelling CPU-disk communication. A CPU-disk system is consider...
This paper deals with a new approximation method for large scale queuing network models with multipl...
Networks of queues which have a productform solution can be analyzed easily by the convolution metho...
This article provides a comparison among different methods for estimating the aggregation of Interne...
Networks of queues which have a productform solution can be analyzed easily by the convolution metho...
International audienceQueuing networks with Fork/Join mechanisms are encountered in modelling and an...
models for interactive computing systems. One of the earliest analyses was done by Scherr [ 11 for t...
The amount of detail to include in a performance model is usually regarded as a judgment to be made ...
This paper deals with a new approximation method for large scale queueing network models with multip...
Fork/join stations are used for modeling synchronization between entities, and fork/join queueing ne...
We consider mathematical models of multiprogrammed computer systems expressed in the form of closed ...
In this paper we study some aggregation methods for the analysis of closed queuing networks. The met...
The two primary issues in choosing a computing system model are credibility of the model and cost of...
In this paper we describe two types of complex server aggregations which can be used to model collec...
An approximate analytical method for estimating performance statistics of general closed queueing ne...
This paper deals with the problem of modelling CPU-disk communication. A CPU-disk system is consider...
This paper deals with a new approximation method for large scale queuing network models with multipl...
Networks of queues which have a productform solution can be analyzed easily by the convolution metho...
This article provides a comparison among different methods for estimating the aggregation of Interne...
Networks of queues which have a productform solution can be analyzed easily by the convolution metho...
International audienceQueuing networks with Fork/Join mechanisms are encountered in modelling and an...
models for interactive computing systems. One of the earliest analyses was done by Scherr [ 11 for t...
The amount of detail to include in a performance model is usually regarded as a judgment to be made ...
This paper deals with a new approximation method for large scale queueing network models with multip...
Fork/join stations are used for modeling synchronization between entities, and fork/join queueing ne...
We consider mathematical models of multiprogrammed computer systems expressed in the form of closed ...