AbstractThe aim of this paper is to investigate the effect of the different service disciplines, such as FIFO, PS, Priority Processor Sharing, Polling, on the main performance measures, such as utilizations, response times, throughput, mean queue length. It has been shown by numerical examples that even in the case of homogeneous sources and homogeneous failure and repair times, the CPU utilization depends on the scheduling discipline contrary to the case of reliable terminal systems. All random variables involved in the model construction are supposed to be exponentially distributed and independent of each other
AbstractWe consider an infinite capacity M/M/c queueing system with c unreliable servers, in which t...
In this article, we study a queueing system serving multiple classes of customers. Each class has a ...
Multiprocessor system models are extensively used in modelling transaction processing systems, nodes...
AbstractThe aim of this paper is to investigate the effect of the different service disciplines, suc...
This paper deals with a non-homogeneous finite-source queuing model to describe the performance of a...
AbstractThis paper deals with a non-homogeneous queueing model to describe the performance of a mult...
AbstractThe paper deals with the derivation of optimal control rules for finite source queueing syst...
This paper considers a closed queueing network model for the case of a number of different terminals...
AbstractThe queueing system to be analysed is a model of a terminal system subject to random breakdo...
AbstractThis paper deals with the optimization of CP utilization in a CP-Terminal system with expone...
AbstractA single server facility is equipped to perform a collection of operations. The service rend...
AbstractThe paper deals with the CPU utilization of multiprogrammed computer systems. First a statis...
AbstractA model of a system with N parallel processors subject to occasional interruptions of servic...
Fault-tolerant systems with repair-upon-failure strategy can become expensive in terms of labour and...
We consider a slotted queueing system with $C$ servers (processors) that can handle tasks (jobs). Ta...
AbstractWe consider an infinite capacity M/M/c queueing system with c unreliable servers, in which t...
In this article, we study a queueing system serving multiple classes of customers. Each class has a ...
Multiprocessor system models are extensively used in modelling transaction processing systems, nodes...
AbstractThe aim of this paper is to investigate the effect of the different service disciplines, suc...
This paper deals with a non-homogeneous finite-source queuing model to describe the performance of a...
AbstractThis paper deals with a non-homogeneous queueing model to describe the performance of a mult...
AbstractThe paper deals with the derivation of optimal control rules for finite source queueing syst...
This paper considers a closed queueing network model for the case of a number of different terminals...
AbstractThe queueing system to be analysed is a model of a terminal system subject to random breakdo...
AbstractThis paper deals with the optimization of CP utilization in a CP-Terminal system with expone...
AbstractA single server facility is equipped to perform a collection of operations. The service rend...
AbstractThe paper deals with the CPU utilization of multiprogrammed computer systems. First a statis...
AbstractA model of a system with N parallel processors subject to occasional interruptions of servic...
Fault-tolerant systems with repair-upon-failure strategy can become expensive in terms of labour and...
We consider a slotted queueing system with $C$ servers (processors) that can handle tasks (jobs). Ta...
AbstractWe consider an infinite capacity M/M/c queueing system with c unreliable servers, in which t...
In this article, we study a queueing system serving multiple classes of customers. Each class has a ...
Multiprocessor system models are extensively used in modelling transaction processing systems, nodes...