{\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

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

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)

Cites Work

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

Cited In (17)

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

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)