Mixed Pfair/ERfair scheduling of asynchronous periodic tasks

DOI10.1016/j.jcss.2003.08.002zbMath1072.68011OpenAlexW2015495501MaRDI QIDQ1878684

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)

Related Items (23)

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

Cites Work

• Unnamed Item
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• Proportionate progress: A notion of fairness in resource allocation
• Optimal rate-based scheduling on multiprocessors

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