Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Cache-Related Preemption and Migration Delays: Empirical Approximation and Impact on Schedulability
 

Summary: Cache-Related Preemption and Migration Delays:
Empirical Approximation and Impact on Schedulability
Andrea Bastoni
Bjšorn B. Brandenburg
James H. Anderson
Abstract
A job that is impeded by a preemption or migration incurs
additional cache misses when it resumes execution due to
a loss of cache affinity. While often regarded negligible in
scheduling-theoretic work, such cache-related delays must
be accounted for when comparing scheduling algorithms in
real systems. Two empirical methods to approximate cache-
related preemption and migration delays on actual hard-
ware are proposed, and a case study reporting measured
average- and worst-case overheads on a 24-core Intel sys-
tem with a hierarchy of shared caches is presented. The
widespread belief that migrations are always more costly
than preemptions is refuted by the observed results. Ad-
ditionally, an experiment design for schedulability studies
that allows algorithms to be compared objectively under

  

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

 

Collections: Computer Technologies and Information Sciences