scientific article; zbMATH DE number 3823138
From MaRDI portal
Publication:3668866
zbMATH Open0519.68052MaRDI QIDQ3668866FDOQ3668866
Authors: S. F. Yashkov 
Publication date: 1983
Title of this publication is not available (Why is that?)
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cited In (31)
- Processor sharing: a survey of the mathematical theory
- The \(M/G/1\) processor-sharing queue with disasters
- Queueing system with processor sharing and limited memory under control of the AQM mechanism
- Explicit formulas for the variance of conditioned sojourn times in \(M/D/1\)-PS
- On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes
- Queuing system with processor sharing and limited resources
- A note on application of the method of supplementary variables to the analysis of a processor sharing system
- A decomposition theorem and related results for the discriminatory processor sharing queue
- SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
- On sojourn times in \(M/GI\) systems under state-dependent processor sharing
- Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
- The \(M/G/1\) queue with processor sharing and its relation to a feedback queue
- Sojourn time asymptotics in processor sharing queues with varying service rate
- Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
- Sojourn time in an \(\mathrm{M}/\mathrm{M}/1\) processor sharing queue with permanent customers
- Asymptotic expansions of defective renewal equations with applications to perturbed risk models and processor sharing queues
- On the sojourn of an arbitrary customer in an \(M/M/1\) processor sharing queue
- On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
- Single-channel system with circular access or processor-sharing and branching processes
- Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing
- Mathematical problems in the theory of processor-sharing queueing systems
- Mathematical theory of queueing networks
- Tail behavior of conditional sojourn times in processor-sharing queues
- Processor-sharing and random-service queues with semi-Markovian arrivals
- Processor-sharing queues: Some progress in analysis
- A Functional Equation Arising in a Queue With a Gating Mechanism
- Analysis of the M/G/1 processor-sharing queue with bulk arrivals
- On differential equations arising in the theory of processor sharing queues
- Sojourn times in a processor sharing queue with multiple vacations
- Sojourn time distribution in a MAP/M/1 processor-sharing queue
- Batch sojourn time in the \(M^{[X]}/M/1\) processor sharing queue with geometric batch size
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3668866)
