On processor sharing and random service

DOI10.2307/3213712MaRDI QIDQ3675301zbMATH OpenOpenAlexFDO

Authors

Publication date 1984

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

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

zbMATH Keywords

processor-sharing service disciplinesojourn time

Mathematics Subject Classification ID

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

Cited in

(13)

• On sojourn times in the finite capacity \(M/M/1\) queue with processor sharing
• Processor-sharing queues: Some progress in analysis
• Mathematical problems in the theory of processor-sharing queueing systems
• Sojourn time distribution in a MAP/M/1 processor-sharing queue
• The equivalence between processor sharing and service in random order.
• Counterexamples to conjectures on discriminatory processor sharing and generalized processor sharing systems
• Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• Processor-sharing and random-service queues with semi-Markovian arrivals
• On a processor sharing queue that models balking
• Stable strategies for processor sharing systems
• Processor sharing: a survey of the mathematical theory
• Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue

This page was built for publication: On processor sharing and random service

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