{\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines

DOI10.1007/S11241-010-9109-2zbMath1213.68147OpenAlexW2054415527MaRDI QIDQ613790

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

zbMATH Keywords

multiprocessor schedulingperiodic taskssporadic taskshard real-time systemsunconstrained deadlines

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (3)

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

• 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
• Unnamed Item

This page was built for publication: {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines