HomePublicationsPaper

Job Phasing Aware Preemption Deferral
Ref: HURRAY-TR-111203       Publication Date: 24, Oct, 2011

Abstract:
Preemptions account for a non-negligible overhead during system execution. There has been substantial amount of research on estimating the delay incurred due to the loss of working sets in the processor state (caches, registers, TLBs) and some on avoiding preemptions, or limiting the preemption cost. We present an algorithm to reduce preemptions by further delaying the start of execution of high priority tasks in fixed priority scheduling. Our approaches take advantage of the \emph{floating non-preemptive regions} model and explore the fact that, during the schedule, the relative task phasing will differ from the worst-case scenario in terms of admissible preemption deferral. Furtehrmore, approximations to reduce the complexity of the proposed approach are presented. Substantial set of experiments demonstrate that the approach and approximations improve over existing work, in particular for the case of high utilisation systems.

José Marinho

,

Stefan M. Petters

Document:

View
PDF Download
PDF