T-L plane-based real-time scheduling for homogeneous multiprocessors

DOI10.1016/J.JPDC.2009.12.003MaRDI QIDQ666041zbMATH OpenOpenAlexFDO

Authors Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen

Publication date 7 March 2012

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2009.12.003

zbMATH Keywords

multiprocessor systemsoptimalityreal-time scheduling

Mathematics Subject Classification ID

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

Recommendations

• {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
• Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
• Deadline-based scheduling of periodic task systems on multiprocessors.
• Integrating job parallelism in real-time scheduling theory
• Multiprocessor scheduling for real-time systems

Cites work

• Priority-driven scheduling of periodic task systems on multiprocessors
• Proportionate progress: A notion of fairness in resource allocation
• Scheduling with deadlines and loss functions

Cited in

(3)

• Cluster scheduling for real-time systems: utilization bounds and run-time overhead
• {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
• An optimal boundary fair scheduling algorithm for multiprocessor real-time systems

This page was built for publication: T-L plane-based real-time scheduling for homogeneous multiprocessors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666041)