Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

DOI10.1007/S11241-011-9114-0MaRDI QIDQ656084zbMATH OpenOpenAlexFDO

Authors Konstantinos Bletsas, Björn Andersson

Publication date 26 January 2012

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

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

zbMATH Keywords

multicoremultiprocessor schedulingmigrationspreemptionsutilisation bound

Mathematics Subject Classification ID

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

Recommendations

• CPMD-mindful task assignment for NPS-F
• Optimal virtual cluster-based multiprocessor scheduling
• Utilization bounds for multiprocessor rate-monotonic scheduling
• An \(\mathsf{EDF}\)-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems
• scientific article; zbMATH DE number 1305442

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
• Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
• Proportionate progress: A notion of fairness in resource allocation
• Schedulability issues for EDZL scheduling on real-time multiprocessor systems

Cited in

(13)

• A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling
• Cluster scheduling for real-time systems: utilization bounds and run-time overhead
• Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
• CPU scheduling and memory management for interactive real-time applications
• Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems
• Real-time application mapping for many-cores using a limited migrative model
• Priority-free conditionally-preemptive scheduling of modular sporadic real-time systems
• An optimal boundary fair scheduling
• Optimal virtual cluster-based multiprocessor scheduling
• CPMD-mindful task assignment for NPS-F
• Unified overhead-aware schedulability analysis for slot-based task-splitting
• Bounding the Power of Preemption in Randomized Scheduling
• The maximum gain of increasing the number of preemptions in multiprocessor scheduling

This page was built for publication: Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

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