Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems

DOI10.1007/S11241-016-9251-6zbMATH Open1357.68022OpenAlexW2299328032MaRDI QIDQ298048FDOQ298048

Authors: Ernesto Massa, George Lima, Paul Regnier, Greg Levin, Scott A. Brandt 

Publication date: 20 June 2016

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

Full work available at URL: https://doi.org/10.1007/s11241-016-9251-6

Recommendations

• The partitioned dynamic-priority scheduling of sporadic task systems
• Partitioned EDF scheduling: a closer look
• {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
• Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
• Semi-partitioned scheduling of dynamic real-time workload: a practical approach based on analysis-driven load balancing

zbMATH Keywords

optimalityschedulingreal-time systemsmultiprocessor

Mathematics Subject Classification ID

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

Cites Work

• Proportionate progress: A notion of fairness in resource allocation
• Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
• Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
• Scheduling with deadlines and loss functions
• Optimal virtual cluster-based multiprocessor scheduling
• Title not available (Why is that?)
• {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
• Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme
• {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
• Utility accrual real-time scheduling for multiprocessor embedded systems

Cited In (5)

• Robust partitioned scheduling for real-time multiprocessor systems
• A survey of real-time scheduling on multiprocessor systems
• The partitioned dynamic-priority scheduling of sporadic task systems
• Improving adaptivity and fairness of processing real-time tasks with QoS requirements on clusters through dynamic scheduling
• Quasi-Static Scheduling of Communicating Tasks

This page was built for publication: Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems

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