The equivalence between processor sharing and service in random order.
From MaRDI portal
Recommendations
- Queues with equally heavy sojourn time and service requirement distributions
- A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications
- Processor-sharing and random-service queues with semi-Markovian arrivals
- The sojourn time in the GI/M/1 queue by processor sharing
- Sojourn time asymptotics in processor-sharing queues
Cites work
- An Analysis of the M/G/1 Queue Under Round-Robin Scheduling
- Analysis of A time‐shared processor
- 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
- scientific article; zbMATH DE number 2088525 (Why is no real title available?)
- scientific article; zbMATH DE number 3943021 (Why is no real title available?)
- scientific article; zbMATH DE number 3656855 (Why is no real title available?)
- scientific article; zbMATH DE number 3755546 (Why is no real title available?)
- scientific article; zbMATH DE number 1466126 (Why is no real title available?)
- Mathematical problems in the theory of processor-sharing queueing systems
- Networks of queues and the method of stages
- Note on the GI/GI/1 queue with LCFS-PR observed at arbitrary times
- On processor sharing and random service
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Processor-sharing queues: Some progress in analysis
- Response-Time Distribution for a Processor-Sharing System
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
- The Distribution of Queuing Network States at Input and Output Instants
- The gi/m/1 processor-sharing queue and its heavy traffic analysis
- The multiple phase service network with generalized processor sharing
- 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
- The waiting time distribution for the random order service M/M/1 queue
- Time-shared Systems
- Waiting Time Distributions for Processor-Sharing Systems
Cited in
(30)- On sojourn times in the finite capacity \(M/M/1\) queue with processor sharing
- Sojourn time distribution in a MAP/M/1 processor-sharing queue
- Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/1 queue under random order service discipline
- When random-order-of-service outperforms first-come-first-served
- Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview
- Random-order-of-service for heterogeneous customers: waiting time analysis
- Sojourn time asymptotics in processor sharing queues with varying service rate
- Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
- Heavy-traffic asymptotics for the single-server queue with random order of service
- Large deviations of sojourn times in processor sharing queues
- Sojourn time asymptotics in processor-sharing queues
- Sojourn times in the \(M/ PH/1\) processor sharing queue
- Analysis of a Markovian queue with customer interjections and finite buffer
- Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies
- SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
- Large deviations of the waiting time in the GI/G/1 queue with random order service
- M/M/∞ Transience: Tail Asymptotics of Congestion Periods
- Factorized time-dependent distributions for certain multiclass queueing networks and an application to enzymatic processing networks
- Sojourn time in an \(\mathrm{M}/\mathrm{M}/1\) processor sharing queue with permanent customers
- Sojourn time in a \(M^{[X]}/M/1\) processor sharing queue with batch arrivals
- Stationary analysis of the ``shortest queue first service policy: the asymmetric case
- FLUID LIMIT OF A PS-QUEUE WITH MULTISTAGE SERVICE
- Batch sojourn time in the \(M^{[X]}/M/1\) processor sharing queue with geometric batch size
- HEAVY-TRAFFIC ANALYSIS OF A NON-PREEMPTIVE MULTI-CLASS QUEUE WITH RELATIVE PRIORITIES
- A bitcoin-inspired infinite-server model with a random fluid limit
- On a processor sharing queue that models balking
- Fluid limit for a multi-server, multiclass random order of service queue with reneging and tracking of residual patience times
- \(M/G/1/\mathrm{MLPS}\) compared with \(M/G/1/\mathrm{PS}\) within service time distribution class IMRL
- Tail behavior of conditional sojourn times in processor-sharing queues
- Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue
This page was built for publication: The equivalence between processor sharing and service in random order.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1413911)
