Towards Budgeting in Real-Time Calculus: Deferrable Servers
نویسندگان
چکیده
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.
منابع مشابه
Towards Periodic Budgeting in Real-Time Calculus
In this report, we extend the real-time calculus model with a periodic budgeting mechanism known as deferrable service. Based on this extended model, we prove a schedulability theorem for a real-time task under a deferrable server. Using this theorem, we show by means of an example that existing schedulability analysis for real-time tasks under a deferrable server is pessimistic rather than exact.
متن کاملTowards Exploiting the Preservation Strategy of Deferrable Servers
Worst-case response time analysis of hard real-time tasks under hierarchical fixed priority pre-emptive scheduling (H-FPPS) has been addressed in a number of papers. Based on an exact schedulability condition, we showed in [4] that the existing analysis can be improved for H-FPPS when deferrable servers are used. In this paper, we reconsider response time analysis and show that improvements are...
متن کاملRT-Xen: Towards Real-time Hierarchical Scheduling in Xen
Recent years have seen significant demand for supporting real-time systems in virtualized environments as system integration become an increasingly important challenge for complex real-time systems. This paper presents RT-Xen, the first hierarchical real-time scheduling framework for Xen, the most widely used open-source virtual machine monitor (VMM). RT-Xen bridges the gap between hierarchical...
متن کاملAnalysis of hierarchical fixed-priority pre-emptive scheduling revisited
This paper revisits worst-case response time analysis of real-time tasks under hierarchical fixed-priority preemptive scheduling. Using an example consisting of a single server and a single hard real-time task, we show that existing worst-case response time analysis can be improved for deferrable servers and sporadic servers when a server is exclusively used for hard real-time tasks. Moreover, ...
متن کاملGlobal Real-Time Multi-Core Virtual Machine Scheduling in Xen
Recent years have witnessed two major trends in the development of complex real-time systems. First, to reduce cost and enhance flexibility, multiple systems are sharing common computing platforms via virtualization technology, instead of being deployed separately on physically isolated hosts. Second, with the evolution and integration of hardware, multi-core processors are increasingly being u...
متن کامل