Mixed Pfair/ERfair scheduling of asynchronous periodic tasks

DOI10.1016/J.JCSS.2003.08.002MaRDI QIDQ1878684zbMATH OpenOpenAlexFDO

Authors James H. Anderson, Anand Srinivasan

Publication date 8 September 2004

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.2003.08.002

zbMATH Keywords

deadline-based algorithmPD2

Mathematics Subject Classification ID

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

Recommendations

• Optimal rate-based scheduling on multiprocessors
• {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
• A new fair scheduling algorithm for periodic tasks on multiprocessors
• Improved conditions for bounded tardiness underepdfpfair multiprocessor scheduling
• A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• Optimal rate-based scheduling on multiprocessors
• Proportionate progress: A notion of fairness in resource allocation

Cited in

(25)

• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPN
• Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling
• An optimal boundary fair scheduling
• Real-time processing of streaming big data
• Generalized tardiness bounds for global multiprocessor scheduling
• Tardiness bounds under global EDF scheduling on a multiprocessor
• A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm
• Task reweighting under global scheduling on multiprocessors
• Using a lag-balance property to tighten tardiness bounds for global EDF
• Hitting Families of Schedules for Asynchronous Programs
• Unified overhead-aware schedulability analysis for slot-based task-splitting
• On centralized smooth scheduling
• Cluster scheduling for real-time systems: utilization bounds and run-time overhead
• Optimal rate-based scheduling on multiprocessors
• An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
• A counter-example to: ``Sticky-ERfair: a task-processor affinity aware proportional fair scheduler
• Sticky-ERfair: a task-processor affinity aware proportional fair scheduler
• Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
• Partition oriented frame based fair scheduler
• A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF
• Improved conditions for bounded tardiness underepdfpfair multiprocessor scheduling
• Group-based Pfair scheduling
• The non-preemptive scheduling of periodic tasks upon multiprocessors
• The directional \(p\)-median problem: definition, complexity, and algorithms

This page was built for publication: Mixed Pfair/ERfair scheduling of asynchronous periodic tasks

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