A proportional share resource allocation algorithm for real-time, time-shared systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Design and Evaluation of a Feedback Control EDF Scheduling Algorithm
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Whisper: a spread spectrum approach to occlusion in acoustic tracking
Whisper: a spread spectrum approach to occlusion in acoustic tracking
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
Journal of Computer and System Sciences
Implementing Pfairness on a Symmetric Multiprocessor
RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
Video enhancement using per-pixel virtual exposures
ACM SIGGRAPH 2005 Papers
Fair scheduling of dynamic task systems on multiprocessors
Journal of Systems and Software - Special issue: Parallel and distributed real-time systems
Fine-Grained Task Reweighting on Multiprocessors
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Accuracy versus Migration Overhead in Real-Time Multiprocessor Reweighting Algorithms
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Tardiness bounds under global EDF scheduling on a multiprocessor
Real-Time Systems
| Hi-index | 0.00 |
We consider schemes for enacting task share changes--a process called reweighting--on real-time multiprocessor platforms. Our particular focus is reweighting schemes that are deployed in environments in which tasks may frequently request significant share changes. Prior work has shown that fair scheduling algorithms are capable of reweighting tasks with minimal allocation error and that partitioning-based scheduling algorithms can reweight tasks with better average-case performance, but greater error. However, preemption and migration overheads can be high in fair schemes. In this paper, we consider the question of whether non-fair, earliest-deadline-first ( $\mathsf{EDF}$ ) global scheduling techniques can improve the accuracy of reweighting relative to partitioning-based schemes and provide improved average-case performance relative to fair-scheduled systems. Our conclusion is that, for soft real-time systems, global $\mathsf{EDF}$ schemes provide a good mix of accuracy and average-case performance.