Batch arrival processor-sharing with application to multi-level processor-sharing scheduling

DOI10.1007/S11134-005-1666-ZzbMath1089.60049OpenAlexW2085967505MaRDI QIDQ2572914

Yanyan Li

Publication date: 7 November 2005

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-005-1666-z

zbMATH Keywords

work conservation

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (12)

Optimal choice of threshold in two level processor sharing ⋮ An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue ⋮ Sojourn times in a processor sharing queue with multiple vacations ⋮ Recent sojourn time results for multilevel processor‐sharing scheduling disciplines ⋮ Batch processor sharing with hyper-exponential service time ⋮ Batch sojourn time in the processor sharing queue with geometric batch size ⋮ Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals ⋮ A survey on discriminatory processor sharing ⋮ Energy-performance trade-off for processor sharing queues with setup delay ⋮ Sojourn times in (discrete) time shared systems and their continuous time limits ⋮ On energy-aware \(M/G/1\)-LAS queue with batch arrivals ⋮ Waiting times for \(M/M\) systems under state-dependent processor sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Processor-sharing queues: Some progress in analysis
• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• Bandwidth sharing and admission control for elastic traffic
• Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
• A note on the conservation law for queues with batch arrivals
• Technical Note—Distribution of Attained and Residual Service in General Queuing Systems
• The processor‐sharing queueing model for time‐shared systems with bulk arrivals

This page was built for publication: Batch arrival processor-sharing with application to multi-level processor-sharing scheduling