{\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling

DOI10.1007/S11241-011-9130-0zbMATH Open1243.68106OpenAlexW2037468202MaRDI QIDQ436211FDOQ436211

Authors Shelby Funk, Greg Levin, Caitlin Sadowski, Ian Pye, Scott A. Brandt

Publication date 30 July 2012

Published in Real-Time Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11241-011-9130-0

zbMATH Keywords

real-time schedulingsporadic tasksmultiprocessor schedulingconstrained deadlinesfair scheduling

Mathematics Subject Classification ID

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

Recommendations

• Optimal rate-based scheduling on multiprocessors
• Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
• A new fair scheduling algorithm for periodic tasks on multiprocessors
• The partitioned dynamic-priority scheduling of sporadic task systems
• Multiprocessor scheduling for real-time systems

Cites work

• A new algorithm for scheduling periodic, real-time tasks
• A survey of hard real-time scheduling for multiprocessor systems
• An optimal multiprocessor real-time scheduling algorithm
• On a Real-Time Scheduling Problem
• Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
• Optimal time-critical scheduling via resource augmentation
• Proportionate progress: A notion of fairness in resource allocation
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Scheduling with deadlines and loss functions

Cited in

(19)

• {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
• Dual-priority versus background scheduling: A path-wise comparison
• Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors
• Cluster scheduling for real-time systems: utilization bounds and run-time overhead
• Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPN
• The partitioned dynamic-priority scheduling of sporadic task systems
• Isolation scheduling on multicores: model and scheduling approaches
• Laxity dynamics and LLF schedulability analysis on multiprocessor platforms
• A new fair scheduling algorithm for periodic tasks on multiprocessors
• An optimal boundary fair scheduling
• Optimal rate-based scheduling on multiprocessors
• An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• Unified overhead-aware schedulability analysis for slot-based task-splitting
• An integrated DBP for streams with (m, k)-firm real-time guarantee
• Multi-rate fluid scheduling of mixed-criticality systems on multiprocessors
• Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems
• Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
• Explicit fair scheduling for dynamic control

This page was built for publication: {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling

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