Sojourn times in (discrete) time shared systems and their continuous time limits

DOI10.1007/s11134-008-9092-7zbMath1156.90333OpenAlexW2015363366MaRDI QIDQ1007142

Arzad A. Kherani

Publication date: 27 March 2009

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

Full work available at URL: https://doi.org/10.1007/s11134-008-9092-7

zbMATH Keywords

discriminatory processor sharingage based schedulingresidual processing time based schedulingtime shared systems

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• On the response time distribution in a discrete round-robin queue
• Preferential treatment for short flows to reduce web latency.
• The maximum queue length for heavy-tailed service times in the \(M/G/1\) FB queue
• Large deviations of sojourn times in processor sharing queues
• Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
• A new approach to the M/G/1 processor-sharing queue
• Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
• On extremal service disciplines in single-stage queueing systems
• Quadrature Methods for Integral Equations of the Second Kind Over Infinite Intervals
• Sharing a Processor Among Many Job Classes
• Asymptotic convergence of scheduling policies with respect to slowdown
• Asymptotic Evaluation of Delay in the SRPT Scheduler
• Waiting Time Distributions for Processor-Sharing Systems
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline

This page was built for publication: Sojourn times in (discrete) time shared systems and their continuous time limits