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

DOI10.1007/BF01194397zbMath0947.90022MaRDI QIDQ1298741

Andreas Brandt, Manfred Brandt

Publication date: 22 August 1999

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

stabilitynumerical algorithmsingle server systemmean sojourn timespermanent customersPoisson streams

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (7)

On the stability of the multi-queue multi-server processor sharing with limited service ⋮ Power series approximations for two-class generalized processor sharing systems ⋮ Processor sharing: a survey of the mathematical theory ⋮ Analysis of generalized processor-sharing systems with two classes of customers and exponential services ⋮ A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications ⋮ A batch arrival priority queue with recurrent repeated demands, admission control and hybrid failure recovery discipline ⋮ Waiting times for \(M/M\) systems under state-dependent processor sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Head of the line processor sharing for many symmetric queues with finite capacity
• An algorithm for Ph/Ph/c queues
• Processor-sharing queues: Some progress in analysis
• A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
• A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline
• Workloads and waiting times in single-server systems with multiple customer classes
• A note on the stability of the many-queue head-of-the-line processor-sharing system with permanent customers
• A new approach to the M/G/1 processor-sharing queue
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• Response-Time Distribution for a Processor-Sharing System
• Asymptotic Analysis of the Waiting-Time Distribution for a Large Closed Processor-Sharing System
• Power Series for Stationary Distributions of Coupled Processor Models
• Waiting times in discrete-time cyclic-service systems
• Sharing a Processor Among Many Job Classes
• Processor-sharing of two parallel lines
• On the diffusion approximation to two parallel queues with processor sharing
• Two coupled processors: The reduction to a Riemann-Hilbert problem
• Diffusion Approximation for Head-of-the-Line Processor Sharing for Two Parallel Queues
• Time-shared Systems
• Waiting Time Distributions for Processor-Sharing Systems

This page was built for publication: On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers