Processor-sharing queues: Some progress in analysis

DOI10.1007/BF01182931zbMath0648.68050OpenAlexW2067707013MaRDI QIDQ1105368

S. F. Yashkov

Publication date: 1987

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01182931

zbMATH Keywords

response timequeue lengthsojourn time distributionstime sharingM/G/1/\(\infty \) queueprocessor-sharing queueing systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (52)

Diffusion approximation for a processor sharing queue in heavy traffic. ⋮ SEH: size estimate hedging for single-server queues ⋮ A decomposition theorem and related results for the discriminatory processor sharing queue ⋮ SRPT applied to bandwidth-sharing networks ⋮ On mathematical models of the service networks ⋮ On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes ⋮ Waiting time distributions for closed \(M/M/N\) processor sharing queues ⋮ \(M/G/1/\mathrm{MLPS}\) compared with \(M/G/1/\mathrm{PS}\) within service time distribution class IMRL ⋮ Sojourn Time Analysis for Processor Sharing Loss System with Unreliable Server ⋮ A single server queue with gated processor-sharing discipline ⋮ Tail behavior of conditional sojourn times in processor-sharing queues ⋮ Queuing system with processor sharing and limited resources ⋮ Analysis of the M/G/1 processor-sharing queue with bulk arrivals ⋮ A foreground-background queueing model with speed or capacity modulation ⋮ Analysis of retrial queuing system with limited processor sharing discipline and changing effective bandwidth ⋮ The equivalence between processor sharing and service in random order. ⋮ Mathematical theory of queueing networks ⋮ Recent sojourn time results for multilevel processor‐sharing scheduling disciplines ⋮ Processor sharing: a survey of the mathematical theory ⋮ A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline ⋮ Processor-sharing and random-service queues with semi-Markovian arrivals ⋮ The \(M/G/1\) queue with processor sharing and its relation to a feedback queue ⋮ Heavy traffic limit for a processor sharing queue with soft deadlines ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ Explicit formulas for the variance of conditioned sojourn times in \(M/D/1\)-PS ⋮ Place reservation: Delay analysis of a novel scheduling mechanism ⋮ 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 ⋮ Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals ⋮ Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue ⋮ \(M/G/1/MLPS\) compared to \(M/G/1/PS\) ⋮ 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 ⋮ Analyzing of Licensed Shared Access Scheme Model with Service Bit Rate Degradation in 3GPP Network ⋮ On the Variance of the Least Attained Service Policy and Its Use in Multiple Bottleneck Networks ⋮ On energy-aware \(M/G/1\)-LAS queue with batch arrivals ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue ⋮ The customer response times in the processor sharing queue are associated ⋮ Waiting times for \(M/M\) systems under state-dependent processor sharing ⋮ PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING ⋮ On the M/G/1 foreground-background processor-sharing queue ⋮ On the nonoptimality of the foreground-background discipline for IMRL service times ⋮ On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers ⋮ Stability of an M\(|G|1\) queue with thick tails and excess capacity ⋮ Sojourn times in the \(M/ PH/1\) processor sharing queue ⋮ Batch arrival processor-sharing with application to multi-level processor-sharing scheduling ⋮ The M/G/1 processor-sharing model: Transient behavior

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
• M/G/\(\infty\) tandem queues
• On the response time distribution in a discrete round-robin queue
• 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
• On processor sharing and random service
• Queueing Networks: A Survey of Their Random Processes
• Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem
• Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO
• The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue
• Approximations of the Mean Waiting Time in an M/G/s Queueing System
• Sharing a Processor Among Many Job Classes
• Performance evaluation studies for time-sharing computer systems
• Brownian Excursion, the M/M/1 Queue and Their Occupation Times
• Direct Solutions of M/G/1 Processor-Sharing Models
• Queueing Models for Computer Communications System Analysis
• Time-Sharing Service Systems. I
• Conditional expected sojourn times in insensitive queueing systems and networks
• Waiting Time Distributions for Processor-Sharing Systems
• An Analysis of the M/G/1 Queue Under Round-Robin Scheduling

This page was built for publication: Processor-sharing queues: Some progress in analysis