The M/G/1 processor-sharing model: Transient behavior

DOI10.1007/BF01158868MaRDI QIDQ1319842zbMATH OpenOpenAlexFDO

Authors M. Yu. Kitaev

Publication date 18 December 1994

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01158868

zbMATH Keywords

marked point processbranching processrandom time changerandom measuretransient behaviorpredictable projectiontime-sharingprocessor-sharingM/G/1 modelvirtual sojourn time distribution

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• The sojourn-time distribution in the M/G/1 queue by processor sharing
• Processor-sharing queues: Some progress in analysis
• Waiting time distributions for closed \(M/M/N\) processor sharing queues
• On the transient behavior of the processor sharing queue

Cites work

• scientific article; zbMATH DE number 4201334 (Why is no real title available?)
• scientific article; zbMATH DE number 3716546 (Why is no real title available?)
• scientific article; zbMATH DE number 3772724 (Why is no real title available?)
• scientific article; zbMATH DE number 19793 (Why is no real title available?)
• scientific article; zbMATH DE number 20653 (Why is no real title available?)
• scientific article; zbMATH DE number 3562235 (Why is no real title available?)
• scientific article; zbMATH DE number 3272022 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• scientific article; zbMATH DE number 3069542 (Why is no real title available?)
• A new approach to the M/G/1 processor-sharing queue
• Limit Theorems for Markov Renewal Processes
• Multivariate point processes: predictable projection, Radon-Nikodym derivatives, representation of martingales
• Numerical Inversion of Laplace Transforms Using a Fourier Series Approximation
• On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
• Point processes and queues. Martingale dynamics
• Processor-Shared Time-Sharing Models in Heavy Traffic
• Processor-sharing queues: Some progress in analysis
• The M/G/1 processor sharing queue as the almost sure limit of feedback queues
• The Fourier-series method for inverting transforms of probability distributions
• The \(M/G/1\) queue with processor sharing and its relation to a feedback queue
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time
• The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue
• Transient behavior of the M/M/1 queue via Laplace transforms
• Waiting Time Distributions for Processor-Sharing Systems

Cited in

(17)

• Transient analysis of a Markovian queue with deterministic rejection
• Sojourn times in the \(M/ PH/1\) processor sharing queue
• The \(M/G/1\) processor-sharing queue with disasters
• scientific article; zbMATH DE number 3886854 (Why is no real title available?)
• Time-dependent properties of symmetric queues
• Splitting Trees Stopped when the First Clock Rings and Vervaat's Transformation
• Some Time-Dependent Properties of Symmetric M/G/1 Queues
• A useful relationship between epidemiology and queueing theory: The distribution of the number of infectives at the moment of the first detection
• Additive functionals with application to sojourn times in infinite-server and processor sharing systems
• Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
• Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
• The completion time of a job on multimode systems
• A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues
• scientific article; zbMATH DE number 67676 (Why is no real title available?)
• Transient Behavior of the M/G/1 Workload Process
• On the distribution of the number of customers in the symmetric M/G/1 queue
• On the transient behavior of the processor sharing queue

This page was built for publication: The M/G/1 processor-sharing model: Transient behavior

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1319842)