The equivalence between processor sharing and service in random order.

DOI10.1016/S0167-6377(03)00006-3zbMath1041.90009OpenAlexW2053793452MaRDI QIDQ1413911

Onno J. Boxma, Rudesindo Núñez-Queija, John A. Morrison, Sem C. Borst

Publication date: 17 November 2003

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(03)00006-3

Mathematics Subject Classification ID

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

Related Items (28)

FLUID LIMIT OF A PS-QUEUE WITH MULTISTAGE SERVICE ⋮ Analysis of a Markovian queue with customer interjections and finite buffer ⋮ Large deviations of the waiting time in the GI/G/1 queue with random order service ⋮ Tail behavior of conditional sojourn times in processor-sharing queues ⋮ On a processor sharing queue that models balking ⋮ Sojourn time distribution in a MAP/M/1 processor-sharing queue ⋮ Factorized time-dependent distributions for certain multiclass queueing networks and an application to enzymatic processing networks ⋮ HEAVY-TRAFFIC ANALYSIS OF A NON-PREEMPTIVE MULTI-CLASS QUEUE WITH RELATIVE PRIORITIES ⋮ Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline ⋮ Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview ⋮ Sojourn time asymptotics in processor sharing queues with varying service rate ⋮ 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 time in a Processor Sharing queue with batch arrivals ⋮ Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue ⋮ Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue ⋮ Heavy-traffic asymptotics for the single-server queue with random order of service ⋮ A Bitcoin-inspired infinite-server model with a random fluid limit ⋮ SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE ⋮ Large deviations of sojourn times in processor sharing queues ⋮ Sojourn time asymptotics in processor-sharing queues ⋮ Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies ⋮ When random-order-of-service outperforms first-come-first-served ⋮ Stationary analysis of the “Shortest Queue First” service policy: The asymmetric case ⋮ M/M/∞ Transience: Tail Asymptotics of Congestion Periods ⋮ On sojourn times in the finite capacity \(M/M/1\) queue with processor sharing ⋮ Sojourn times in the \(M/ PH/1\) processor sharing queue ⋮ Random-order-of-service for heterogeneous customers: waiting time analysis

Cites Work

• Processor-sharing queues: Some progress in analysis
• Mathematical problems in the theory of processor-sharing queueing systems
• The multiple phase service network with generalized processor sharing
• The waiting time distribution for the random order service \(M/M/1\) queue
• NOTE ON THE GI/GI/1 QUEUE WITH LCFS-PR OBSERVED AT ARBITRARY TIMES
• 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
• On processor sharing and random service
• The Distribution of Queuing Network States at Input and Output Instants
• The gi/m/1 processor-sharing queue and its heavy traffic analysis
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Networks of queues and the method of stages
• Analysis of A time‐shared processor
• Time-shared Systems
• Waiting Time Distributions for Processor-Sharing Systems
• An Analysis of the M/G/1 Queue Under Round-Robin Scheduling
• Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The equivalence between processor sharing and service in random order.