Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes
From MaRDI portal
Publication:3219544
DOI10.2307/1427058zbMath0556.60038MaRDI QIDQ3219544
John A. Morrison, Debasis Mitra
Publication date: 1985
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1427058
asymptotic approximation; processor-sharing discipline; closed queueing networks; equilibrium waiting time
60K25: Queueing theory (aspects of probability theory)
60K35: Interacting random processes; statistical mechanics type models; percolation theory
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.)
Related Items
Sojourn time distribution in some processor-shared queues, The Unconditional Sojourn Time Distribution in the Queue GI/M/1‐K with Processor Sharing Service, Asymptotic analysis of a large closed queueing network with discriminatory processor sharing, Mathematical theory of queueing networks, Processor-sharing queues: Some progress in analysis, A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline, Mathematical problems in the theory of processor-sharing queueing systems, Asymptotic analysis for closed multiclass queueing networks in critical usage, The equivalence between processor sharing and service in random order., Sojourn time asymptotics in processor-sharing queues
