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

DOI10.1007/s11241-016-9251-6zbMath1357.68022OpenAlexW2299328032MaRDI QIDQ298048

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

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

zbMATH Keywords

schedulingoptimalityreal-time systemsmultiprocessor

Mathematics Subject Classification ID

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

Related Items (1)

A survey of real-time scheduling on multiprocessor systems

Cites Work

• Unnamed Item
• {\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
• Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
• Utility accrual real-time scheduling for multiprocessor embedded systems
• Optimal virtual cluster-based multiprocessor scheduling
• Proportionate progress: A notion of fairness in resource allocation
• Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
• Scheduling with Deadlines and Loss Functions

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