Towards budgeting in real-time calculus : deferrable servers

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

6 Citations (Scopus)
91 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationProceedings of the 5th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2007) 3-5 October 2007, Salzburg, Austria
EditorsJ.F. Raskin, P.S. Thiagarajan
Place of PublicationBerlin, Germany
PublisherSpringer
Pages98-113
ISBN (Print)978-3-540-75453-4
DOIs
Publication statusPublished - 2007
Eventconference; FORMATS 2007, Salzburg, Austria; 2007-10-03; 2007-10-05 -
Duration: 3 Oct 20075 Oct 2007

Publication series

NameLecture Notes in Computer Science
Volume4763
ISSN (Print)0302-9743

Conference

Conferenceconference; FORMATS 2007, Salzburg, Austria; 2007-10-03; 2007-10-05
Period3/10/075/10/07
OtherFORMATS 2007, Salzburg, Austria

Fingerprint Dive into the research topics of 'Towards budgeting in real-time calculus : deferrable servers'. Together they form a unique fingerprint.

Cite this