On processor sharing and random service
From MaRDI portal
Publication:3675301
DOI10.2307/3213712zbMath0562.60097OpenAlexW2312629096MaRDI QIDQ3675301
No author found.
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
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (11)
Processor-sharing queues: Some progress in analysis ⋮ On a processor sharing queue that models balking ⋮ Sojourn time distribution in a MAP/M/1 processor-sharing queue ⋮ The equivalence between processor sharing and service in random order. ⋮ Processor sharing: a survey of the mathematical theory ⋮ Processor-sharing and random-service queues with semi-Markovian arrivals ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue ⋮ Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue ⋮ On sojourn times in the finite capacity \(M/M/1\) queue with processor sharing
This page was built for publication: On processor sharing and random service
