Direct Solutions of M/G/1 Processor-Sharing Models

DOI10.1287/OPRE.22.6.1232zbMATH Open0294.60076OpenAlexW1994989659MaRDI QIDQ4046879FDOQ4046879

Thomas M. O'Donovan

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

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Cited In (12)

• Processor sharing: a survey of the mathematical theory
• A decomposition theorem and related results for the discriminatory processor sharing queue
• Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers
• The efficiency-fairness balance of round robin scheduling
• Mean sojourn times for phase-type discriminatory processor sharing systems
• Mehrstufige-Auswahldisziplin in einem M/G/1 Processor-Sharing System mit Prioritaeten
• Mathematical problems in the theory of processor-sharing queueing systems
• Processor-sharing queues: Some progress in analysis
• A survey on discriminatory processor sharing
• The Unconditional Sojourn Time Distribution in the Queue GI/M/1‐K with Processor Sharing Service
• Sojourn times in a processor sharing queue with multiple vacations
• Title not available (Why is that?)

This page was built for publication: Direct Solutions of M/G/1 Processor-Sharing Models

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