Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory

DOI10.1007/s11241-014-9205-9zbMath1338.68040OpenAlexW2016486323MaRDI QIDQ495922

Felipe Cerqueira, Arpan Gujarati, Björn B. Brandenburg

Publication date: 16 September 2015

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

Full work available at URL: https://doi.org/10.1007/s11241-014-9205-9

zbMATH Keywords

real-time systemsmultiprocessorsschedulability analysisprocessor affinities

Mathematics Subject Classification ID

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

Related Items (1)

Correspondence article: a correction of the reduction-based schedulability analysis for APA scheduling

Cites Work

• Unnamed Item
• Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme
• Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
• Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
• Optimal virtual cluster-based multiprocessor scheduling
• Proportionate progress: A notion of fairness in resource allocation
• Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
• A survey of hard real-time scheduling for multiprocessor systems
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory