Processor sharing: a survey of the mathematical theory

DOI10.1134/S0005117907090202zbMath1147.93003MaRDI QIDQ927561

A. S. Yashkova, S. F. Yashkov

Publication date: 9 June 2008

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

queueing systemEgalitarian Processor Sharing (EPS)time-dependent (transient) probability distributions

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Queues and service in operations research (90B22) Control/observation systems involving computers (process control, etc.) (93C83) Research exposition (monographs, survey articles) pertaining to systems and control theory (93-02) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)

Related Items (29)

Evaluation and prediction of an optimal control in a processor sharing queueing system with heterogeneous servers ⋮ Semi-linear stochastic difference equations ⋮ On mathematical models of the service networks ⋮ On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes ⋮ An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue ⋮ Sojourn Time Analysis for Processor Sharing Loss Queuing System with Service Interruptions and MAP Arrivals ⋮ Sojourn Time Analysis for Processor Sharing Loss System with Unreliable Server ⋮ Additive functionals with application to sojourn times in infinite-server and processor sharing systems ⋮ The fluid limit of the multiclass processor sharing queue ⋮ Queuing system with processor sharing and limited resources ⋮ Analysis of retrial queuing system with limited processor sharing discipline and changing effective bandwidth ⋮ Analysis of a queueing system with mixed service discipline ⋮ Multitype branching processes with immigration in random environment, and polling systems ⋮ Tail asymptotics of the waiting time and the busy period for the \(\mathrm{M}/\mathrm{G}/1/K\) queues with subexponential service times ⋮ A retrial queueing system with processor sharing ⋮ Analysis of the queuing systems with processor sharing service discipline and random serving rate coefficients ⋮ Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing ⋮ Dynamic interactive stabilization of systems of flow with processor sharing ⋮ Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue ⋮ Heavy-Tailed Branching Process with Immigration ⋮ On sojourn times in \(M/GI\) systems under state-dependent processor sharing ⋮ Combination of Queueing Systems of Different Types with Common Buffer: A Theoretical Treatment ⋮ 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 ⋮ Queueing models for the analysis of communication systems ⋮ Instability of sharing systems in the presence of retransmissions ⋮ Queueing systems with random volume customers and a sectorized unlimited memory buffer ⋮ The Model and Algorithms for Estimation the Performance Measures of Access Node Serving the Mixture of Real Time and Elastic Data ⋮ WCFS: a new framework for analyzing multiserver systems

Cites Work

• 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
• 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
• Discriminatory processor sharing queues with stationary ergodic service times and the performance of TCP in overload
• Numerical inversion of the Laplace transform: a survey and comparison of methods
• On the Laplace transform of the Pareto distribution
• \(M/G/1/\mathrm{MLPS}\) compared with \(M/G/1/\mathrm{PS}\) within service time distribution class IMRL
• Time-dependent analysis of M/G/1 vacation models with exhaustive service
• Mathematical theory of queueing networks
• On inference concerning time-dependent queue performance: The M/G/1 example
• The average virtual waiting time as a measure of performance
• Calculation of the Laplace transform of the length of the busy period for the M/G/1 queue via martingales
• Theory of queuing networks and its applications to the analysis of information-computing systems
• Processor-sharing queues: Some progress in analysis
• A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
• Mathematical problems in the theory of processor-sharing queueing systems
• The Fourier-series method for inverting transforms of probability distributions
• On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
• Rare events in queueing systems -- A survey
• Waiting-time tail probabilities in queues with long-tail service-time distributions
• On the transient behavior of the processor sharing queue
• A decomposition theorem and related results for the discriminatory processor sharing queue
• Limits and approximants for the M/G/1 LIFO waiting-time distribution
• The waiting time distribution for the random order service \(M/M/1\) queue
• Fluid approximations for a processor-sharing queue
• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• Sojourn time distribution in a MAP/M/1 processor-sharing queue
• A diffusion model for two parallel queues with processor sharing: Transient behavior and asymptotics
• Sojourn times in a processor sharing queue with service interruptions
• Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
• Sampling at subexponential times, with queueing applications
• Stationary queuing systems with dependencies
• A LIFO queue in heavy traffic
• Diffusion approximation for a processor sharing queue in heavy traffic.
• Branching processes. II
• Appendix: A primer on heavy-tailed distributions
• On the behavior of LIFO preemptive resume queues in heavy traffic
• Explicit formulas for the variance of conditioned sojourn times in \(M/D/1\)-PS
• Mathematical methods to study the polling systems
• A finite capacity \(BMAPK/GK/1\) queue with the generalized foreground-background processor-sharing discipline
• 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
• A survey on discriminatory processor sharing
• Priority queues
• Asymptotic relations in queueing theory
• Sojourn times in the \(M/ PH/1\) processor sharing queue
• SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
• Stochastic-Process Limits
• On a heavy traffic limit theorem for the M/G/1 processor-sharing queue
• A note on the ℒ-class of life distributions
• Regenerative stochastic processes
• On Queues with Poisson Arrivals
• 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
• On the nonoptimality of the foreground-background discipline for IMRL service times
• Analysis of the GI/GI/1 Queue and its Variations via the LCFS Preemptive Resume Discipline and Its Random Walk Interpretation
• SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
• Analysis, Design, and Control of Queueing Systems
• On processor sharing and random service
• Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO
• Time-Dependent Analysis Of Queueing Systems
• 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
• On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1
• Sharing a Processor Among Many Job Classes
• Performance evaluation studies for time-sharing computer systems
• Crump–Mode–Jagers Branching Processes As a Method of Investigating ${\rm M}/{\rm G}/1$ Systems with Processor Sharing
• An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
• On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
• Direct Solutions of M/G/1 Processor-Sharing Models
• Asymptotic properties of supercritical branching processes I: The Galton-Watson process
• Technical Note—The Queue M/G/1 When Jobs Are Scheduled within Generations
• On the tails of waiting-time distributions
• Queueing output processes
• Queueing Models for Computer Communications System Analysis
• Approximation techniques in the solution of queueing problems
• Transient Behavior of the M/G/1 Workload Process
• Performance Decay in a Single Server Exponential Queueing Model with Long Range Dependence
• Applied Probability and Queues
• Stationary increments in the accumulated work process in processor-sharing queues
• Conditional expected sojourn times in insensitive queueing systems and networks
• NUMERICAL TRANSFORM INVERSION USING GAUSSIAN QUADRATURE
• Branching Processes
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• Time-shared Systems
• A Time-Sharing Queue
• Waiting Time Distributions for Processor-Sharing Systems
• Time Sharing with Priorities
• Multiple channel queues in heavy traffic. I
• On the quasi-stationary distribution of the virtual waiting time in queues with Poisson arrivals
• Processor-sharing and random-service queues with semi-Markovian arrivals
• Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
• Large Deviations of Square Root Insensitive Random Sums
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• What is the Laplace Transform?
• Queueing networks with discrete time scale. Explicit expressions for the steady state behaviour of discrete time stochastic networks
• An ergodicity condition for a cyclic queueing system
• Analysis of the M/M/1 queue with processor sharing via spectral theory

This page was built for publication: Processor sharing: a survey of the mathematical theory