Dynamic routing of real-time jobs among parallel EDF queues: a performance study
From MaRDI portal
Publication:605686
Recommendations
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline
- Admission and routing of soft real-time jobs to multiclusters: design and comparison of index policies
- Extremal scheduling of parallel processing with and without real-time constraints
- A two-class \(M/M/1\) system with preemptive non real-time jobs and prioritized real-time jobs under earliest-deadline-first policy
- Dynamic on-line task scheduling on parallel processors
Cited in
(10)- A dynamic priority assignment technique for streams with (m, k)-firm deadlines
- Routing jobs with deadlines to heterogeneous parallel servers
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline
- Real-Time Performance Estimation for Dynamic, Distributed Real-Time Systems
- A two-class \(M/M/1\) system with preemptive non real-time jobs and prioritized real-time jobs under earliest-deadline-first policy
- Loss ratio of the EDF scheduling policy with early discarding technique
- Research of heterogeneous queueing system \(SM| M^{(n)}|\infty\)
- Admission and routing of soft real-time jobs to multiclusters: design and comparison of index policies
- An integrated DBP for streams with (m, k)-firm real-time guarantee
- scientific article; zbMATH DE number 2166899 (Why is no real title available?)
This page was built for publication: Dynamic routing of real-time jobs among parallel EDF queues: a performance study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q605686)