{\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-2zbMath1213.68147MaRDI QIDQ613790
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
multiprocessor scheduling; periodic tasks; sporadic tasks; hard real-time systems; unconstrained deadlines
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68M14: Distributed systems
Related Items
Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems, Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach, An optimal boundary fair scheduling
Cites Work
- Unnamed Item
- EDZL scheduling analysis
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- Proportionate progress: A notion of fairness in resource allocation
- A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment