{\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
From MaRDI portal
Publication:613790
DOI10.1007/S11241-010-9109-2zbMATH Open1213.68147OpenAlexW2054415527MaRDI QIDQ613790FDOQ613790
Authors: Maryline Mikael Shelby Funk 
Publication date: 22 December 2010
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-010-9109-2
Recommendations
- T-L plane-based real-time scheduling for homogeneous multiprocessors
- {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
- An optimal multiprocessor real-time scheduling algorithm
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Proportionate progress: A notion of fairness in resource allocation
- Title not available (Why is that?)
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm
- EDZL scheduling analysis
Cited In (4)
This page was built for publication: {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613790)
