The sojourn time in the GI/M/1 queue by processor sharing

DOI10.2307/3213654MaRDI QIDQ3332052zbMATH OpenOpenAlexFDO

Authors Vaidyanathan Ramaswami

Publication date 1984

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3213654

zbMATH Keywords

FCFS disciplineequilibrium sojourn time

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• Asymptotic approximations for the gi/m/1 queue with processor-sharing service
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• scientific article; zbMATH DE number 3972594
• GI/G/1 processor sharing queue in heavy traffic
• The gi/m/1 processor-sharing queue and its heavy traffic analysis

Cited in

(30)

• Discriminatory Processor Sharing Queues and the DREB Method
• Explicit formulas for the variance of conditioned sojourn times in \(M/D/1\)-PS
• The \(M/G/1\) processor-sharing queue with disasters
• Processor-sharing queues: Some progress in analysis
• The Unconditional Sojourn Time Distribution in the Queue GI/M/1‐K with Processor Sharing Service
• Sojourn time distribution in a MAP/M/1 processor-sharing queue
• scientific article; zbMATH DE number 3972594 (Why is no real title available?)
• Sojourn time distribution in some processor-shared queues
• Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
• Locality of reference and the use of sojourn time variance for measuring queue unfairness
• Ratio between average sojourn times under processor sharing and fair sojourn protocol
• A cost-equation analysis of general-input general-service processor sharing system
• The Conditional Sojourn Time Distribution in the GI/M/1 Processor-Sharing Queue in Heavy Traffic
• Processor sharing: a survey of the mathematical theory
• Mathematical problems in the theory of processor-sharing queueing systems
• Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue
• Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals
• Additive functionals with application to sojourn times in infinite-server and processor sharing systems
• The conditional sojourn time distribution in the \(GI/M/1\) processor- sharing queue in heavy traffic
• The equivalence between processor sharing and service in random order.
• On sojourn times in \(M/GI\) systems under state-dependent processor sharing
• A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications
• Sojourn time asymptotics in processor-sharing queues
• Response times in gated M/G/1 queues: The processor-sharing case
• Processor-sharing and random-service queues with semi-Markovian arrivals
• Asymptotic approximations for the gi/m/1 queue with processor-sharing service
• A note on the processor-sharing queue in a quasi-reversible network
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• On the stability of the multi-queue multi-server processor sharing with limited service

This page was built for publication: The sojourn time in the GI/M/1 queue by processor sharing

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