@inproceedings{ef79d1ead70f432f8d29e40fb767a571,

title = "Towards budgeting in real-time calculus : deferrable servers",

abstract = "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.",

author = "P.J.L. Cuijpers and R.J. Bril",

year = "2007",

doi = "10.1007/978-3-540-75454-1_9",

language = "English",

isbn = "978-3-540-75453-4",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "98--113",

editor = "J.F. Raskin and P.S. Thiagarajan",

booktitle = "Proceedings of the 5th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2007) 3-5 October 2007, Salzburg, Austria",

address = "Germany",

note = "conference; FORMATS 2007, Salzburg, Austria; 2007-10-03; 2007-10-05 ; Conference date: 03-10-2007 Through 05-10-2007",

}