The M/G/1 processor-sharing model: Transient behavior
type: Item
instance of: scholarly article
title: The M/G/1 processor-sharing model: Transient behavior
zbMATH Open document ID: 0802.68011
DOI: 10.1007/BF01158868
author: M. Yu. Kitaev
published in: Queueing Systems
publication date: 1994-12-18T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 553651
zbMATH Keywords: M/G/1 model
zbMATH Keywords: time-sharing
zbMATH Keywords: transient behavior
zbMATH Keywords: virtual sojourn time distribution
zbMATH Keywords: branching process
zbMATH Keywords: marked point process
zbMATH Keywords: random measure
zbMATH Keywords: predictable projection
zbMATH Keywords: random time change
zbMATH Keywords: processor-sharing
MaRDI profile type: Publication
cites work: Transient behavior of the M/M/1 queue via Laplace transforms
cites work: The Fourier-series method for inverting transforms of probability distributions
cites work: The \(M/G/1\) queue with processor sharing and its relation to a feedback queue
cites work: Q5556844
cites work: Point processes and queues. Martingale dynamics
cites work: Waiting Time Distributions for Processor-Sharing Systems
cites work: Numerical Inversion of Laplace Transforms Using a Fourier Series Approximation
cites work: Q5624436
cites work: Processor-Shared Time-Sharing Models in Heavy Traffic
cites work: Q3349736
cites work: Q3979864
cites work: On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
cites work: Multivariate point processes: predictable projection, Radon-Nikodym derivatives, representation of martingales
cites work: Q5808656
cites work: Q3906873
cites work: Q4134686
cites work: The sojourn-time distribution in the M/G/1 queue by processor sharing
cites work: Q3952958
cites work: Limit Theorems for Markov Renewal Processes
cites work: The M/G/1 processor sharing queue as the almost sure limit of feedback queues
cites work: A new approach to the M/G/1 processor-sharing queue
cites work: The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue
cites work: The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time
cites work: Processor-sharing queues: Some progress in analysis
cites work: Q3979296
full work available at URL: https://doi.org/10.1007/bf01158868
OpenAlex ID: W2066265020
description: scientific article; zbMATH DE number 553651