Accuracy versus Migration Overhead in Real-Time Multiprocessor Reweighting Algorithms

Authors:
Aaron Block;James H. Anderson
Affiliations:
University of North Carolina at Chapel Hill, USA;University of North Carolina at Chapel Hill, USA
Venue:
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Year:
2006

Citing 8
Cited 3

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
Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems

Real-Time Systems
Video enhancement using per-pixel virtual exposures

ACM SIGGRAPH 2005 Papers
Fine-Grained Task Reweighting on Multiprocessors

RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

Task reweighting under global scheduling on multiprocessors

Real-Time Systems
Partition oriented frame based fair scheduler

Journal of Parallel and Distributed Computing
Sticky-ERfair: a task-processor affinity aware proportional fair scheduler

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. However, in such schemes preemption and migration overheads can be high. In this paper, we consider the question of whether the lower migration costs of partitioning-based schemes can provide improved average-case performance relative to fair-scheduled systems. Our conclusion is that partitioning-based schemes are capable of providing significantly lower overall error (including "error" due to preemption and migration costs) than fair schemes in the average case. However, partitioning-based schemes are incapable of providing strong fairness and real-time guarantees.