Asymptotic convergence of scheduling policies with respect to slowdown

DOI10.1016/S0166-5316(02)00132-3zbMath1043.68035OpenAlexW2040073315MaRDI QIDQ4788422

Karl Sigman, Adam Wierman, Mor Harchol-Balter

Publication date: 21 January 2003

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-5316(02)00132-3

zbMATH Keywords

processor-sharingM/GI/1 queue

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (8)

Quantitative fairness for assessing perceived service quality in queues ⋮ Transplant queueing ⋮ Invariance of fluid limits for the shortest remaining processing time and shortest job first policies ⋮ ASYMPTOTIC PROPERTIES OF SOJOURN TIMES IN MULTICLASS TIME-SHARED SYSTEMS ⋮ Recent sojourn time results for multilevel processor‐sharing scheduling disciplines ⋮ On the Value Function of the M/G/1 FCFS and LCFS Queues ⋮ Large deviations of sojourn times in processor sharing queues ⋮ Sojourn times in (discrete) time shared systems and their continuous time limits

This page was built for publication: Asymptotic convergence of scheduling policies with respect to slowdown