Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Accuracy versus Migration Overhead in Real-Time Multiprocessor Reweighting Aaron Block and James H. Anderson
 

Summary: Accuracy versus Migration Overhead in Real-Time Multiprocessor Reweighting
Algorithms
Aaron Block and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
Abstract
We consider schemes for enacting task share changes--a
process called reweighting--on real-time multiprocessor plat-
forms. Our particular focus is reweighting schemes that are
deployed in environments in which tasks may frequently re-
quest significant share changes. Prior work has shown that fair
scheduling algorithms are capable of reweighting tasks with
minimal allocation error. However, in such schemes preemp-
tion 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 sig-
nificantly lower overall error (including "error" due to preemp-
tion and migration costs) than fair schemes in the average case.
However, partitioning-based schemes are incapable of provid-

  

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences