Fluid limits for earliest-deadline-first networks
From MaRDI portal
Publication:2685907
Recommendations
- Law of large numbers for the many-server earliest-deadline-first queue
- Stability of Join-the-Shortest-Queue networks: Analysis by Fluid Limits
- Fluid limits for shortest job first with aging
- Fluid limit of generalized Jackson queueing networks with stationary and ergodic arrivals and service times
- Stability of join-the-shortest-queue networks
- Heavy traffic approximation for the stationary distribution of stochastic fluid networks
- An open queueing network with asymptotically stable fluid model and unconventional heavy traffic behavior
- Convergence rate of fluid approximation for Jackson network with multi-server in heavy traffic
- Stability of preemptive EDF queueing networks
Cites work
- A Skorokhod map on measure-valued paths with applications to priority queues
- A subsidy-surplus model and the Skorokhod problem in an orthant.
- Applying queueing theory to the study of emergency department operations: a survey and a discussion of comparable simulation studies
- Conditioning as disintegration
- Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
- Double Skorokhod Map and Reneging Real-Time Queues
- Earliest-deadline-first service in heavy-traffic acyclic networks.
- Fluid limit of a heavily loaded EDF queue with impatient customers
- Fluid limits for many-server systems with reneging under a priority policy
- Fluid limits for shortest job first with aging
- Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline
- Hard real-time computing systems. Predictable scheduling algorithms and applications.
- Heavy traffic analysis for EDF queues with reneging
- Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions
- scientific article; zbMATH DE number 1631026 (Why is no real title available?)
- scientific article; zbMATH DE number 3723610 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- Invariant states for fluid models of EDF networks: nonlinear lifting map
- Large deviations and queueing networks: Methods for rate function identification
- Law of large numbers for the many-server earliest-deadline-first queue
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- On queues with impatience: stability, and the optimality of earliest deadline first
- Open Queueing Networks in Heavy Traffic
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline
- Reflected Brownian motion on an orthant
- Stability of earliest-due-date, first-served queueing networks
- Stability of two families of real-time queueing networks
- The fluid limit of a heavily loaded processor sharing queue
Cited in
(11)- Edge minimality of EDF resource sharing networks
- Stability of linear EDF networks with resource sharing
- Earliest-deadline-first service in heavy-traffic acyclic networks.
- Approximating Earliest Arrival Flows in Arbitrary Networks
- Invariant states for fluid models of EDF networks: nonlinear lifting map
- Minimality of EDF networks with resource sharing
- Fluid limit of a heavily loaded EDF queue with impatient customers
- Statistical analysis of delay bound violations at an earliest deadline first (EDF) scheduler
- Stability of preemptive EDF queueing networks
- Heavy traffic analysis for EDF queues with reneging
- Fluid limits for earliest-deadline-first networks
This page was built for publication: Fluid limits for earliest-deadline-first networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2685907)
