Fine-Grained Task Reweighting on Multiprocessors

Authors:
Aaron Block;James H. Anderson;Gary Bishop
Affiliations:
University of North Carolina at Chapel Hill;University of North Carolina at Chapel Hill;University of North Carolina at Chapel Hill
Venue:
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2005

Citing 0
Cited 5

Locking under Pfair scheduling

ACM Transactions on Computer Systems (TOCS)
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
Optimal rate-based scheduling on multiprocessors

Journal of Computer and System Sciences
Task reweighting under global scheduling on multiprocessors

Real-Time Systems
A schedulable utilization bound for the multiprocessor EPDF Pfair algorithm

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of task reweighting in fair-scheduled multiprocessor systems wherein each task驴s processor share is specified as a weight. Task reweighting can be used as a means for consuming (or making available) spare processing capacity. In this paper, we propose a multiprocessor reweighting scheme that can change a task驴s processor share with "minimal" error per share change.