Mehrstufige-Auswahldisziplin in einem M/G/1 Processor-Sharing System mit Prioritaeten

DOI10.1007/BF02253292zbMath0489.60095OpenAlexW383099559MaRDI QIDQ1166847

R. Koller, A. Yassouridis

Publication date: 1983

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02253292

zbMATH Keywords

multilevel processor-sharing algorithmsystems with priority classes

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Mathematical problems in the theory of processor-sharing queueing systems

Cites Work

• Unnamed Item
• Direct Solutions of M/G/1 Processor-Sharing Models
• Analysis of A time‐shared processor
• Sufficient Conditions for Positive Recurrence and Recurrence of Specially Structured Markov Chains
• The processor‐sharing queueing model for time‐shared systems with bulk arrivals

This page was built for publication: Mehrstufige-Auswahldisziplin in einem M/G/1 Processor-Sharing System mit Prioritaeten