Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
From MaRDI portal
Publication:656084
DOI10.1007/S11241-011-9114-0zbMATH Open1230.68049OpenAlexW2026699559MaRDI QIDQ656084FDOQ656084
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
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
- Title not available (Why is that?)
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
- Proportionate progress: A notion of fairness in resource allocation
- Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- Schedulability issues for EDZL scheduling on real-time multiprocessor systems
Cited In (12)
- Cluster scheduling for real-time systems: utilization bounds and run-time overhead
- A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling
- 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
- 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)
