Discriminatory Processor Sharing Queues and the DREB Method

DOI10.1080/15326340701826872zbMath1173.90365OpenAlexW2127074175MaRDI QIDQ5454667

Xiaoming Liu, Zhaotong Lian, Li-Ming Liu

Publication date: 31 March 2008

Published in: Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326340701826872

zbMATH Keywords

discriminatory processor sharingpriority queuesjoint queue lengthSojourn timeDREB methodlevel-dependentdimensions reductionmulti-dimensional QBD

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• A Markov renewal approach to \(M/G/1\) type queues with countably many background states
• Asymptotic analysis of a large closed queueing network with discriminatory processor sharing
• Continuous-time Markov chains. An applications-oriented approach
• A decomposition theorem and related results for the discriminatory processor sharing queue
• Sojourn time distribution in a MAP/M/1 processor-sharing queue
• Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
• Spectral properties of the tandem Jackson network, seen as a quasi-birth-and-death process
• Waiting time distributions for closed \(M/M/N\) processor sharing queues
• Sojourn times in the \(M/ PH/1\) processor sharing queue
• GEOMETRIC DECAY OF THE STEADY-STATE PROBABILITIES IN A QUASI-BIRTH-AND-DEATH PROCESS WITH A COUNTABLE NUMBER OF PHASES
• SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
• A new approach to the M/G/1 processor-sharing queue
• Conditional response times in the M/G/1 processor-sharing system
• The sojourn time in the GI/M/1 queue by processor sharing
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• Sharing a Processor Among Many Job Classes
• An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
• Technical Note—Conditional Response Times in M/M/1 Processor-Sharing Models
• Waiting time distributions for M/M/N processor sharing queues
• GI/G/1 processor sharing queue in heavy traffic
• SUFFICIENT CONDITIONS FOR A GEOMETRIC TAIL IN A QBD PROCESS WITH MANY COUNTABLE LEVELS AND PHASES
• Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes
• Some properties of the rate perators in level dependent uasi-birth-and-death processes with countable number of phases
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• Time-shared Systems
• Waiting Time Distributions for Processor-Sharing Systems
• Queue-Length Distribution for the Discriminatory Processor-Sharing Queue