Pages that link to "Item:Q1184690"
From MaRDI portal
The following pages link to On optimal lateness and tardiness scheduling in real-time systems (Q1184690):
Displaying 19 items.
- On queues with impatience: stability, and the optimality of earliest deadline first (Q386347) (← links)
- Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling (Q554014) (← links)
- Random trees in queueing systems with deadlines (Q672995) (← links)
- An earlier time for inserting and/or accelerating tasks (Q833042) (← links)
- Improved conditions for bounded tardiness underepdfpfair multiprocessor scheduling (Q840926) (← links)
- The space of EDF deadlines: The exact region and a convex approximation (Q842733) (← links)
- Convex comparison of service disciplines in real time queues (Q1003505) (← links)
- On optimal lateness and tardiness scheduling in real-time systems (Q1184690) (← links)
- LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems (Q1360477) (← links)
- Personalized queues: the customer view, via a fluid model of serving least-patient first (Q1640075) (← links)
- Rate monotonic vs. EDF: judgment day (Q1780175) (← links)
- Bounds on tardiness in scheduling of precedence-constrained unit real-time task systems (Q1860055) (← links)
- Dual-priority versus background scheduling: A path-wise comparison (Q1870169) (← links)
- Loss ratio of the EDF scheduling policy with early discarding technique (Q1941710) (← links)
- Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling (Q2251390) (← links)
- Generalization of EDF and LLF: Identifying all optimal online algorithms for minimizing maximum lateness (Q2479534) (← links)
- Punctuality and idleness in just-in-time scheduling (Q2566707) (← links)
- Algorithm Theory - SWAT 2004 (Q5315393) (← links)
- A performance analysis of minimum laxity and earliest deadline scheduling in a real-time system (Q5375506) (← links)
