Optimal rate-based scheduling on multiprocessors

DOI10.1016/J.JCSS.2006.03.001MaRDI QIDQ5920661zbMATH OpenOpenAlexFDO

Authors Anand Srinivasan, James H. Anderson

Publication date 5 October 2006

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2006.03.001

zbMATH Keywords

fairnessoptimalityreal timeschedulingmultiprocessorspfair

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Recommendations

• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
• A new fair scheduling algorithm for periodic tasks on multiprocessors
• A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm
• Deadline-based scheduling of periodic task systems on multiprocessors.

Cites work

• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• Optimal rate-based scheduling on multiprocessors
• Proportionate progress: A notion of fairness in resource allocation
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Cited in

(16)

• Optimal scheduling of progressive processing tasks
• scientific article; zbMATH DE number 1863333 (Why is no real title available?)
• A new fair scheduling algorithm for periodic tasks on multiprocessors
• Utilization bounds for multiprocessor rate-monotonic scheduling
• A constant-approximate feasibility test for multiprocessor real-time scheduling
• An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
• {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
• Multi-rate fluid scheduling of mixed-criticality systems on multiprocessors
• An optimal boundary fair scheduling
• Optimal virtual cluster-based multiprocessor scheduling
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• An optimal resource sharing protocol for generalized multiframe tasks
• Tardiness bounds under global EDF scheduling on a multiprocessor
• Optimal scheduling for constant-rate multi-mode systems
• Partition oriented frame based fair scheduler
• A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm

This page was built for publication: Optimal rate-based scheduling on multiprocessors

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