Preemption can destabilize the system performance
From MaRDI portal
Cites work
- Bandwidth sharing and admission control for elastic traffic
- Fluid limits for longest job first queues
- Fluid limits for longest remaining time first queues
- Fluid Model for a Data Network with α -Fair Bandwidth Sharing and General Document Size Distributions: Two Examples of Stability
- Fluid models of integrated traffic and multipath routing
- Heavy traffic analysis for EDF queues with reneging
- scientific article; zbMATH DE number 3671443 (Why is no real title available?)
- scientific article; zbMATH DE number 475325 (Why is no real title available?)
- Instability of LRTF multiclass queueing networks
- Instability of SRPT, SERPT and SJF multiclass queueing networks
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Mesure invariante sur les classes r�currentes des processus de Markov
- Network stability under max-min fair bandwidth sharing
- Processing Networks
- Resource sharing networks: overview and an open problem
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Scheduling. Theory, algorithms, and systems.
- Stability and convergence of moments for multiclass queueing networks via fluid limit models
- Stability of earliest-due-date, first-served queueing networks
- Stability of linear EDF networks with resource sharing
- Stability of preemptive EDF queueing networks
- Stability of queueing networks. École d'Été de probabilités de Saint-Flour XXXVI-2006
- Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
This page was built for publication: Preemption can destabilize the system performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285929)
