Mathematical problems in the theory of processor-sharing queueing systems

DOI10.1007/BF01097426zbMath0735.68010MaRDI QIDQ1179867

S. F. Yashkov

Publication date: 27 June 1992

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

queueingperformance measureslimit theoremsprocessor sharing

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (21)

On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes ⋮ The equivalence between processor sharing and service in random order. ⋮ Recent sojourn time results for multilevel processor‐sharing scheduling disciplines ⋮ Processor sharing: a survey of the mathematical theory ⋮ 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 ⋮ 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 ⋮ On sojourn times in \(M/GI\) systems under state-dependent processor sharing ⋮ A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications ⋮ Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue ⋮ Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates ⋮ Sojourn time asymptotics in processor-sharing queues ⋮ A survey on discriminatory processor sharing ⋮ On the Gittins index in the M/G/1 queue ⋮ A note on application of the method of supplementary variables to the analysis of a processor sharing system ⋮ On differential equations arising in the theory of processor sharing queues ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue ⋮ Instability of sharing systems in the presence of retransmissions ⋮ Waiting times for \(M/M\) systems under state-dependent processor sharing

Cites Work

• Time Sharing with Priorities
• An Analysis of the M/G/1 Queue Under Round-Robin Scheduling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix-analytic methods in queueing theory
• Single-channel system with circular access or processor-sharing and branching processes
• Theory of queuing networks and its applications to the analysis of information-computing systems
• Processor-sharing queues: Some progress in analysis
• Boundary value problems in queueing theory
• Interoutput times in processor sharing queues with feedback
• A single server queue with gated processor-sharing discipline
• Wiener-Hopf equations and their applications in probability theory
• A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
• Stationary random processes associated with point processes
• Mehrstufige-Auswahldisziplin in einem M/G/1 Processor-Sharing System mit Prioritaeten
• The customer response times in the processor sharing queue are associated
• On the M/G/1 foreground-background processor-sharing queue
• Interchange arguments in stochastic scheduling
• 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
• A new approach to the M/G/1 processor-sharing queue
• Conditional response times in the M/G/1 processor-sharing system
• 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
• The M/G/1 processor sharing queue as the almost sure limit of feedback queues
• Stochastic Models of Queue Storage
• A Functional Equation Arising in a Queue With a Gating Mechanism
• A Characterization of Product-Form Queuing Networks
• On processor sharing and random service
• Queueing Networks: A Survey of Their Random Processes
• On the single-server queue with the preemptive-resume last-come–first-served queue discipline
• Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem
• Asymptotic Analysis of the Waiting-Time Distribution for a Large Closed Processor-Sharing System
• Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO
• Discrete operator-selfdecomposabiuty and queueing networks
• Time-Dependent Analysis Of Queueing Systems
• Processor-Shared Time-Sharing Models in Heavy Traffic
• Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines
• The completion time of a job on multimode systems
• Dynamics of the M/G/1 Vacation Model
• Transient behavior of the M/M/1 queue via Laplace transforms
• Server sharing with a limited number of service positions and symmetric queues
• The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue
• An Optimal Design Problem for Limited Processor Sharing Systems
• A multiclass feedback queue in heavy traffic
• Power Series for Stationary Distributions of Coupled Processor Models
• Sequential scheduling of priority queues and Arm-acquiring bandits
• Response times in M/M/1 time-sharing schemes with limited number of service positions
• Queues, random graphs and branching processes
• Response times in processor-shared queuses with state-dependent arrival rates
• Sojourn times in the m/g/1 queue with deterministic feedback
• A perturbation method for solving some queues with processor sharing discipline
• Conditioned Response-Time Distribution for a Large Closed Processor-Sharing System with Multiple Classes in Very Heavy Usage
• Sharing a Processor Among Many Job Classes
• On the heavy-traffic limit theorem for GI/G/∞ queues
• A Note on Product-Form Solution for Queuing Networks with Poisson Arrivals and General Service-Time Distributions with Finite Means
• Performance evaluation studies for time-sharing computer systems
• Direct Solutions of M/G/1 Processor-Sharing Models
• Technical Note—The Queue M/G/1 When Jobs Are Scheduled within Generations
• Technical Note—Conditional Response Times in M/M/1 Processor-Sharing Models
• Networks of queues and the method of stages
• Queueing output processes
• Product Form and Local Balance in Queueing Networks
• Queueing Models for Computer Communications System Analysis
• Time-Sharing Service Systems. I
• A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates
• Reneging from Processor Sharing Systems and Random Queues
• Stationary increments in the accumulated work process in processor-sharing queues
• Conditional expected sojourn times in insensitive queueing systems and networks
• Time-shared Systems
• A Time-Sharing Queue
• Waiting Time Distributions for Processor-Sharing Systems

This page was built for publication: Mathematical problems in the theory of processor-sharing queueing systems