Fine-Grained Task Reweighting on Multiprocessors
Aaron Block, James H. Anderson, Gary J. Bishop · 2006
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.