On the transient behavior of the processor sharing queue

DOI10.1007/BF01158692MaRDI QIDQ1339068zbMATH OpenOpenAlexFDO

Authors Alain Jean-Marie, Philippe Robert

Publication date 9 January 1995

Published in Queueing Systems (Search for Journal in Brave)

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

zbMATH Keywords

marked point processPalm probability measureprocessor sharing disciplinetransient behavior of the single server queue

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Review text

The transient behavior of the single server queue under the processor sharing discipline is analysed. The rate of growth of the number of customers in the queue as well as the asymptotic behavior of the residual service times described in terms of a renormalized point process are given. The analysis of the queue of the customers is done under general assumptions. The results are obtained under the hypothesis of stationary arrival process and stationary sequence of service times. The customers arrive according to a stationary ergodic marked point process, its Palm probability measure attached to. It is assumed that the workload of the transient single server queue grows at rate \(\lambda E(\sigma_ 0) - 1>0\), where \(\lambda\) is the arrival rate and \(E(\sigma_ 0)\) the expected value of the service time.

Recommendations

• The M/G/1 processor-sharing model: Transient behavior
• scientific article; zbMATH DE number 3880405
• Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
• GI/G/1 processor sharing queue in heavy traffic
• The sojourn-time distribution in the M/G/1 queue by processor sharing

Cites work

• scientific article; zbMATH DE number 3899912 (Why is no real title available?)
• On a heavy traffic limit theorem for the M/G/1 processor-sharing queue
• Palm probabilities and stationary queues
• Sur les mesures de Palm de deux processus ponctuels stationnaires

Cited in

(21)

• A note on the event horizon for a processor sharing queue
• Processor-sharing queues: Some progress in analysis
• The M/G/1 processor-sharing model: Transient behavior
• On the influence of high priority customers on a generalized processor sharing queue
• On the scheduling of operations in a chat contact center
• On the M/G/1 foreground-background processor-sharing queue
• Heavy-traffic limits for discriminatory processor sharing models with joint batch arrivals
• Transient analysis of an affine queue-Hawkes process
• Transient analysis of a Markovian queue with deterministic rejection
• Large deviations of sojourn times in processor sharing queues
• Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
• A survey on discriminatory processor sharing
• Predicting response times in processor-sharing queues
• The fluid limit of the multiclass processor sharing queue
• A Processor-Shared Queue That Models Switching Times: Normal Usage
• scientific article; zbMATH DE number 67676 (Why is no real title available?)
• PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION
• Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems
• Fluid model solution of feedforward network of overloaded multiclass processor sharing queues
• Analysis of alternating-priority queueing models with (cross) correlated switchover times
• Processor sharing: a survey of the mathematical theory

This page was built for publication: On the transient behavior of the processor sharing queue

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