University of North Carolina
The authors consider schemes for enacting task share changes-a process called reweighting-on real-time multiprocessor platforms. Their particular focus is reweighting schemes that are deployed in environments in which tasks may frequently request significant share changes. This paper 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.