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

DOI10.2307/3213654zbMATH Open0543.60093OpenAlexW2081676700MaRDI QIDQ3332052FDOQ3332052

Authors: Vaidyanathan Ramaswami 

Publication date: 1984

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3213654

Recommendations

• Asymptotic approximations for the gi/m/1 queue with processor-sharing service
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• scientific article; zbMATH DE number 3972594
• GI/G/1 processor sharing queue in heavy traffic
• The gi/m/1 processor-sharing queue and its heavy traffic analysis

zbMATH Keywords

FCFS disciplineequilibrium sojourn time

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cited In (30)

• Processor sharing: a survey of the mathematical theory
• The conditional sojourn time distribution in the \(GI/M/1\) processor- sharing queue in heavy traffic
• The equivalence between processor sharing and service in random order.
• A note on the processor-sharing queue in a quasi-reversible network
• The \(M/G/1\) processor-sharing queue with disasters
• Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
• Explicit formulas for the variance of conditioned sojourn times in \(M/D/1\)-PS
• On sojourn times in \(M/GI\) systems under state-dependent processor sharing
• Locality of reference and the use of sojourn time variance for measuring queue unfairness
• Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals
• A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications
• Title not available (Why is that?)
• Mathematical problems in the theory of processor-sharing queueing systems
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• A Cost-Equation Analysis of General-Input General-Service Processor Sharing System
• Sojourn time distribution in some processor-shared queues
• The Conditional Sojourn Time Distribution in the GI/M/1 Processor-Sharing Queue in Heavy Traffic
• Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue
• Processor-sharing and random-service queues with semi-Markovian arrivals
• Asymptotic approximations for the gi/m/1 queue with processor-sharing service
• Discriminatory Processor Sharing Queues and the DREB Method
• Processor-sharing queues: Some progress in analysis
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• Sojourn time asymptotics in processor-sharing queues
• The Unconditional Sojourn Time Distribution in the Queue GI/M/1‐K with Processor Sharing Service
• Additive functionals with application to sojourn times in infinite-server and processor sharing systems
• Response times in gated M/G/1 queues: The processor-sharing case
• Sojourn time distribution in a MAP/M/1 processor-sharing queue
• Ratio between average sojourn times under processor sharing and fair sojourn protocol
• On the stability of the multi-queue multi-server processor sharing with limited service

This page was built for publication: The sojourn time in the GI/M/1 queue by processor sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3332052)