Sciweavers

RTCSA
2005
IEEE

Fine-Grained Task Reweighting on Multiprocessors

14 years 5 months ago
Fine-Grained Task Reweighting on Multiprocessors
We consider the problem of task reweighting in fair-scheduled multiprocessor systems wherein each task’s processor share is specified as a weight. When a task is reweighted, a new weight is computed for it that is then used in future scheduling. Task reweighting can be used as a means for consuming (or making available) spare processing capacity. The responsiveness of a reweighting scheme can be assessed by comparing its allocations to those of an ideal scheduler that can reweight tasks instantaneously. A reweighting scheme is fine-grained if any additional per-task “error” (in comparison to an ideal allocation) caused by a reweighting event is constant. In prior work on uniprocessor notions of fairness, a number of fine-grained reweighting schemes were proposed. However, in the multiprocessor case, prior work has failed to produce such a scheme. In this paper, we remedy this shortcoming by presenting a multiprocessor reweighting scheme that is fine-grained. We also present ...
Aaron Block, James H. Anderson, Gary Bishop
Added 25 Jun 2010
Updated 25 Jun 2010
Type Conference
Year 2005
Where RTCSA
Authors Aaron Block, James H. Anderson, Gary Bishop
Comments (0)