Laxity dynamics and LLF schedulability analysis on multiprocessor platforms
From MaRDI portal
Publication:2251352
DOI10.1007/s11241-012-9157-xzbMath1291.68086OpenAlexW1971895960MaRDI QIDQ2251352
Insik Shin, Jinkyu Lee, Arvind Easwaran
Publication date: 14 July 2014
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10400.22/3544
real-time schedulingschedulability analysislaxity dynamicsLLF (least laxity first)multiprocessor platforms
Related Items (2)
Laxity dynamics and LLF schedulability analysis on multiprocessor platforms ⋮ A survey of real-time scheduling on multiprocessor systems
Cites Work
- {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
- EDZL scheduling analysis
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- Optimal virtual cluster-based multiprocessor scheduling
- A new algorithm for scheduling periodic, real-time tasks
- Errata: A new algorithm for scheduling periodic, real-time tasks
- Deadline-based scheduling of periodic task systems on multiprocessors.
- Proportionate progress: A notion of fairness in resource allocation
- Laxity dynamics and LLF schedulability analysis on multiprocessor platforms
- A survey of hard real-time scheduling for multiprocessor systems
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Optimal time-critical scheduling via resource augmentation
This page was built for publication: Laxity dynamics and LLF schedulability analysis on multiprocessor platforms
