Direct Solutions of M/G/1 Processor-Sharing Models
From MaRDI portal
Publication:4046879
DOI10.1287/opre.22.6.1232zbMath0294.60076OpenAlexW1994989659MaRDI QIDQ4046879
Publication date: 1974
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.22.6.1232
Related Items (12)
A decomposition theorem and related results for the discriminatory processor sharing queue ⋮ Processor-sharing queues: Some progress in analysis ⋮ Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers ⋮ Sojourn times in a processor sharing queue with multiple vacations ⋮ The efficiency-fairness balance of round robin scheduling ⋮ The Unconditional Sojourn Time Distribution in the Queue GI/M/1‐K with Processor Sharing Service ⋮ Mehrstufige-Auswahldisziplin in einem M/G/1 Processor-Sharing System mit Prioritaeten ⋮ Processor sharing: a survey of the mathematical theory ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ Mean sojourn times for phase-type discriminatory processor sharing systems ⋮ A survey on discriminatory processor sharing ⋮ Unnamed Item
This page was built for publication: Direct Solutions of M/G/1 Processor-Sharing Models
