Waiting Time Distributions for Processor-Sharing Systems
From MaRDI portal
Publication:5594222
DOI10.1145/321556.321568zbMath0197.15304OpenAlexW2007521902WikidataQ29399245 ScholiaQ29399245MaRDI QIDQ5594222
Richard R. Muntz, Hale F. Trotter, Edward G. jun. Coffman
Publication date: 1970
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321556.321568
Related Items (52)
Queueing system with processor sharing and limited memory under control of the AQM mechanism ⋮ A decomposition theorem and related results for the discriminatory processor sharing queue ⋮ Waiting time distributions for closed \(M/M/N\) processor sharing queues ⋮ On the stability of the multi-queue multi-server processor sharing with limited service ⋮ Processor-sharing queues: Some progress in analysis ⋮ An operational view of the \(M/G/1/PS\) queueing model with IO overhead as part of service ⋮ Sojourn time distribution in some processor-shared queues ⋮ Asymptotic Analysis of Spectral Properties of Finite Capacity Processor Shared Queues ⋮ A single server queue with gated processor-sharing discipline ⋮ Tail behavior of conditional sojourn times in processor-sharing queues ⋮ On a processor sharing queue that models balking ⋮ Additive functionals with application to sojourn times in infinite-server and processor sharing systems ⋮ Sojourn times in a processor sharing queue with multiple vacations ⋮ Security screening queues with impatient applicants: a new model with a case study ⋮ 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 ⋮ A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions ⋮ The equivalence between processor sharing and service in random order. ⋮ Fiducial intervals for the waiting time in batch and time-sharing systems ⋮ Processor sharing: a survey of the mathematical theory ⋮ Processor-sharing and random-service queues with semi-Markovian arrivals ⋮ The \(M/G/1\) queue with processor sharing and its relation to a feedback queue ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ Explicit formulas for the variance of conditioned sojourn times in \(M/D/1\)-PS ⋮ Sojourn time in an M/M/1 processor sharing queue with permanent customers ⋮ Batch sojourn time in the processor sharing queue with geometric batch size ⋮ SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING ⋮ Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing ⋮ The \(M/G/1\) processor-sharing queue with disasters ⋮ The conditional sojourn time distribution in the \(GI/M/1\) processor- sharing queue in heavy traffic ⋮ Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue ⋮ Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals ⋮ Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue ⋮ CONDITIONAL SOJOURN TIMES OF PROCESSOR-SHARING QUEUES ⋮ Queueing theory ⋮ On sojourn times in \(M/GI\) systems under state-dependent processor sharing ⋮ 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 ⋮ Sojourn time asymptotics in processor-sharing queues ⋮ Discriminatory Processor Sharing Queues and the DREB Method ⋮ Sojourn times in (discrete) time shared systems and their continuous time limits ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue ⋮ Sojourn times in a random queue with and without preemption ⋮ Instability of sharing systems in the presence of retransmissions ⋮ Single-channel system with circular access or processor-sharing and branching processes ⋮ Waiting times for \(M/M\) systems under state-dependent processor sharing ⋮ Two-stage queueing network models for quality control and testing ⋮ On sojourn times in the finite capacity \(M/M/1\) queue with processor sharing ⋮ On the sojourn of an arbitrary customer in an M/M/1 Processor Sharing Queue ⋮ On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers ⋮ Sojourn times in the \(M/ PH/1\) processor sharing queue ⋮ The M/G/1 processor-sharing model: Transient behavior
This page was built for publication: Waiting Time Distributions for Processor-Sharing Systems
