Results 191 to 200 of about 522 (214)

A survey on discriminatory processor sharing

Queueing Systems, 2006
This paper is a summarizing article about the Discriminatory Processor Sharing (DPS) model. The characteristics of the DPS model is that all jobs present in the system are served simultaneously at rates controlled by a vector of weights \(\{g_{k}>0,\;k=1,2,\dots, K\}\); moreover, if there are \(N_{k}\) \((k=1,2,\dots, K)\) jobs of class \(k\) present ...
Eitan Altman, Konstantin Avrachenkov, Urtzi Ayesta   +2 more
exaly   +3 more sources

Equilibrium strategy of a processor-sharing system with discriminatory discipline

2013 IEEE International Conference on Industrial Engineering and Engineering Management, 2013
Zhaotong Lian
exaly   +3 more sources

Discriminatory Processor Sharing Queues and the DREB Method

Stochastic Models, 2008
We study a discriminatory processor-sharing (DPS) queue with a Markovian arrival process (MAP) and K classes of customers. This system can be modeled into a K-dimensional quasi-birth-and death (QBD) process by the standard matrix-analytical approach, but such a process is computationally difficult to handle.
Xiaoming Liu
exaly   +2 more sources

Asymptotic regimes and approximations for discriminatory processor sharing

ACM SIGMETRICS Performance Evaluation Review, 2004
We study the joint queue length distribution of the Discriminatory Processor Sharing model, assuming all classes have phase-type service requirement distributions. We show that the moments of the joint queue length distribution can be obtained by solving linear equations. We use this to study the system in two asymptotic regimes.
Gijs van Kessel, Rudesindo Núñez-Queija, Sem C. Borst   +2 more
openaire   +2 more sources

A decomposition theorem and related results for the discriminatory processor sharing queue

Queueing Systems, 1994
In this paper, we study a discriminatory processor sharing queue with Poisson arrivals,K classes and general service times. For this queue, we prove a decomposition theorem for the conditional sojourn time of a tagged customer given the service times and class affiliations of the customers present in the system when the tagged customer arrives. We show
Bhaskar Sengupta
exaly   +3 more sources

Tail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements

Performance Evaluation, 2005
We derive the sojourn time asymptotics for a multi-class GI/GI/1 queue with regularly varying service requirements operating under the discriminatory processor-sharing (DPS) discipline. DPS provides a natural approach for modelling the flow-level performance of differentiated bandwidth-sharing mechanisms.
Sem Borst, Bert Zwart
exaly   +3 more sources

Asymptotic analysis of a large closed queueing network with discriminatory processor sharing

Queueing Systems, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Morrison J A
exaly   +3 more sources

Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing

Performance Evaluation, 2004
In this paper, we consider a queue with multiple K job classes, Poisson arrivals, exponentially distributed required service times in which a single processor serves according to the DPS discipline. More precisely, if there are ni class i jobs in the system, i = 1,...,K, each class j job receives a fraction αj/Σi=1k αini of the processor capacity.
Jeongsim Kim, Bara Kim
exaly   +2 more sources

A closed network with a discriminatory processor-sharing server

Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 1989
This paper gives a simple, accurate first order asymptotic analysis of the transient and steady state behavior of a network which is closed, not product-form and has multiple classes. One of the two nodes of the network is an infinite server and the discipline in the other node is discriminatory processor-sharing.
D. Mitra, A. Weiss
openaire   +2 more sources

Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers

Mathematical Methods of Operations Research, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sunggon Kim
exaly   +2 more sources