Budgeting of resources is an often used solution for guaranteeing performance of lower priority tasks. In this paper, we take a formal approach to the modeling of a deferrable server budgeting strategy, using real-time calculus. We prove a scheduling theorem for deferrable servers, and as a corollary show that an earlier claim of Davis and Burns, that periodic servers dominate deferrable servers with respect to schedulability, no longer holds when the context of the comparison is slightly generalized.
|Name||Lecture Notes in Computer Science|
|Conference||conference; FORMATS 2007, Salzburg, Austria; 2007-10-03; 2007-10-05|
|Period||3/10/07 → 5/10/07|
|Other||FORMATS 2007, Salzburg, Austria|