Processor sharing: a survey of the mathematical theory (Q927561)

scientific article

Language	Label	Description	Also known as
English	Processor sharing: a survey of the mathematical theory	scientific article

Statements

instance of

scholarly article

0 references

title

Processor sharing: a survey of the mathematical theory (English)

0 references

0 references

0 references

Automation and Remote Control

0 references

publication date

9 June 2008

0 references

zbMATH Keywords

Egalitarian Processor Sharing (EPS)

0 references

queueing system

0 references

time-dependent (transient) probability distributions

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

$M/G/1/\mathrm{MLPS}$ compared with $M/G/1/\mathrm{PS}$ within service time distribution class IMRL

0 references

On the nonoptimality of the foreground-background discipline for IMRL service times

0 references

Waiting-time tail probabilities in queues with long-tail service-time distributions

0 references

Q4945342

0 references

The Fourier-series method for inverting transforms of probability distributions

0 references

Transient Behavior of the M/G/1 Workload Process

0 references

Limits and approximants for the M/G/1 LIFO waiting-time distribution

0 references

Q3331506

0 references

A Time-Sharing Queue

0 references

A survey on discriminatory processor sharing

0 references

Discriminatory processor sharing queues with stationary ergodic service times and the performance of TCP in overload

0 references

A finite capacity $BMAPK/GK/1$ queue with the generalized foreground-background processor-sharing discipline

0 references

Applied Probability and Queues

0 references

Sampling at subexponential times, with queueing applications

0 references

Conditional response times in the M/G/1 processor-sharing system

0 references

Server sharing with a limited number of service positions and symmetric queues

0 references

Q4485682

0 references

Q5831479

0 references

Analysis of the M/G/1 processor-sharing queue with bulk arrivals

0 references

Theory of queuing networks and its applications to the analysis of information-computing systems

0 references

On Queues with Poisson Arrivals

0 references

Approximation techniques in the solution of queueing problems

0 references

Q4726487

0 references

Asymptotic properties of supercritical branching processes I: The Galton-Watson process

0 references

0 references

0 references

0 references

0 references

0 references

On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers

0 references

A sample path relation for the sojourn times in $G/G/1$-PS systems and its applications

0 references

Q5525727

0 references

Fluid approximations for a processor-sharing queue

0 references

A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

0 references

Insensitive bounds for the moments of the sojourn time distribution in the $M/G/1$ processor-sharing queue

0 references

Waiting Time Distributions for Processor-Sharing Systems

0 references

Asymptotic relations in queueing theory

0 references

On processor sharing and random service

0 references

Q4658190

0 references

Q3946848

0 references

Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO

0 references

Queueing networks with discrete time scale. Explicit expressions for the steady state behaviour of discrete time stochastic networks

0 references

A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions

0 references

Queueing output processes

0 references

Numerical inversion of the Laplace transform: a survey and comparison of methods

0 references

Q3199178

0 references

Q4765076

0 references

Q4878833

0 references

SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE

0 references

Q4343010

0 references

Q4481937

0 references

Sharing a Processor Among Many Job Classes

0 references

Q5512461

0 references

The waiting time distribution for the random order service $M/M/1$ queue

0 references

Stationary increments in the accumulated work process in processor-sharing queues

0 references

Q3678435

0 references

On inference concerning time-dependent queue performance: The M/G/1 example

0 references

Q4001868

0 references

Crump–Mode–Jagers Branching Processes As a Method of Investigating ${\rm M}/{\rm G}/1$ Systems with Processor Sharing

0 references

On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes

0 references

Diffusion approximation for a processor sharing queue in heavy traffic.

0 references

Q4943598

0 references

Analysis of the M/M/1 queue with processor sharing via spectral theory

0 references

Branching Processes

0 references

Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates

0 references

Multiple channel queues in heavy traffic. I

0 references

NUMERICAL TRANSFORM INVERSION USING GAUSSIAN QUADRATURE

0 references

Q4506436

0 references

Q4127752

0 references

Priority queues

0 references

Performance evaluation studies for time-sharing computer systems

0 references

Conditional expected sojourn times in insensitive queueing systems and networks

0 references

On the transient behavior of the processor sharing queue

0 references

Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue

0 references

Large Deviations of Square Root Insensitive Random Sums

0 references

Mathematical theory of queueing networks

0 references

Q5808656

0 references

Q5721605

0 references

Q3906873

0 references

A note on the ℒ-class of life distributions

0 references

0 references

0 references

0 references

0 references

A diffusion model for two parallel queues with processor sharing: Transient behavior and asymptotics

0 references

Queueing Models for Computer Communications System Analysis

0 references

Rare events in queueing systems -- A survey

0 references

Q4888380

0 references

Stationary queuing systems with dependencies

0 references

On the quasi-stationary distribution of the virtual waiting time in queues with Poisson arrivals

0 references

AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue

0 references

On the behavior of LIFO preemptive resume queues in heavy traffic

0 references

A LIFO queue in heavy traffic

0 references

Sojourn time distribution in a MAP/M/1 processor-sharing queue

0 references

Q5572722

0 references

Q5512462

0 references

On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1

0 references

Q3750996

0 references

Response-Time Distribution for a Processor-Sharing System

0 references

On the Laplace transform of the Pareto distribution

0 references

Q5674161

0 references

Sojourn times in a processor sharing queue with service interruptions

0 references

SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING

0 references

Direct Solutions of M/G/1 Processor-Sharing Models

0 references

Technical Note—The Queue M/G/1 When Jobs Are Scheduled within Generations

0 references

Q4065978

0 references

The sojourn-time distribution in the M/G/1 queue by processor sharing

0 references

On the tails of waiting-time distributions

0 references

Q3900799

0 references

The sojourn time in the GI/M/1 queue by processor sharing

0 references

A decomposition theorem and related results for the discriminatory processor sharing queue

0 references

The M/G/1 processor sharing queue as the almost sure limit of feedback queues

0 references

Performance Decay in a Single Server Exponential Queueing Model with Long Range Dependence

0 references

Calculation of the Laplace transform of the length of the busy period for the M/G/1 queue via martingales

0 references

Q3282332

0 references

A new approach to the M/G/1 processor-sharing queue

0 references

The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue

0 references

An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue

0 references

Q3713599

0 references

Sojourn times in the $M/ PH/1$ processor sharing queue

0 references

Analysis of the GI/GI/1 Queue and its Variations via the LCFS Preemptive Resume Discipline and Its Random Walk Interpretation

0 references

Explicit formulas for the variance of conditioned sojourn times in $M/D/1$-PS

0 references

Appendix: A primer on heavy-tailed distributions

0 references

Regenerative stochastic processes

0 references

Analysis, Design, and Control of Queueing Systems

0 references

0 references

0 references

0 references

0 references

Time-dependent analysis of M/G/1 vacation models with exhaustive service

0 references

The average virtual waiting time as a measure of performance

0 references

Time-Dependent Analysis Of Queueing Systems

0 references

An ergodicity condition for a cyclic queueing system

0 references

Branching processes. II

0 references

Mathematical methods to study the polling systems

0 references

Q2702293

0 references

Stochastic-Process Limits

0 references

What is the Laplace Transform?

0 references

Time Sharing with Priorities

0 references

Q3998392

0 references

Processor-sharing and random-service queues with semi-Markovian arrivals

0 references

0 references

0 references

0 references

0 references

Processor-sharing queues: Some progress in analysis

0 references

Q3979296

0 references

Mathematical problems in the theory of processor-sharing queueing systems

0 references

On a heavy traffic limit theorem for the M/G/1 processor-sharing queue

0 references

Q2760877

0 references

Sojourn time asymptotics in the $M/G/1$ processor sharing queue

0 references

Identifiers

zbMATH Open document ID

1147.93003

0 references

DOI

10.1134/S0005117907090202

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:927561