Sojourn times in (discrete) time shared systems and their continuous time limits
From MaRDI portal
Publication:1007142
Recommendations
- ASYMPTOTIC PROPERTIES OF SOJOURN TIMES IN MULTICLASS TIME-SHARED SYSTEMS
- An Approximate Analysis of Sojourn Times in the M/G/1 Queue With Round-Robin Service Discipline
- SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
- On the average sojourn time under \(M/M/1/\)SRPT
- Sojourn times in a processor sharing queue with service interruptions
Cites work
- scientific article; zbMATH DE number 47258 (Why is no real title available?)
- A new approach to the M/G/1 processor-sharing queue
- Asymptotic Evaluation of Delay in the SRPT Scheduler
- Asymptotic convergence of scheduling policies with respect to slowdown
- Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
- Large deviations of sojourn times in processor sharing queues
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- On extremal service disciplines in single-stage queueing systems
- On the response time distribution in a discrete round-robin queue
- Preferential treatment for short flows to reduce web latency.
- Quadrature Methods for Integral Equations of the Second Kind Over Infinite Intervals
- Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
- Sharing a Processor Among Many Job Classes
- The maximum queue length for heavy-tailed service times in the \(M/G/1\) FB queue
- Waiting Time Distributions for Processor-Sharing Systems
Cited in
(3)
This page was built for publication: Sojourn times in (discrete) time shared systems and their continuous time limits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007142)