The Unconditional Sojourn Time Distribution in the Queue GI/M/1‐K with Processor Sharing Service

DOI10.1002/sapm199493129zbMath0812.60086MaRDI QIDQ4319637

Yongzhi Yang, Charles Knessl

Publication date: 14 May 1995

Published in: Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sapm199493129

zbMATH Keywords

singular perturbation methods; asymptotic expansions; queueing model; principle of asymptotic matching

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

Cites Work

• Asymptotic Expansions of Moments of the Waiting Time in a Shared-Processor of an Interactive System
• Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes
• Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes
• 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
• Response-Time Distribution for a Processor-Sharing System
• Asymptotic approximations for the gi/m/1 queue with processor-sharing service
• Direct Solutions of M/G/1 Processor-Sharing Models
• Moments of the conditioned waiting time in a large closed processor-sharing system
• Waiting Time Distributions for Processor-Sharing Systems