Abstract—In open real-time systems with a non-stationary workload, tasks can be dynamically mapped to servers. If a server-based, slack reclamation scheduler is used, each task reserves a fraction of the bandwidth based on its resource esti-mation. However, the slack time scheduler makes no guarantee to a task beyond its processor capacity reserve, i.e., the scheduler cannot guarantee that a soft real-time task will receive a higher quality of service than is specified by its resource reservation. Nevertheless users often assume that a desired quality of service (QoS) can be achieved using an optimistic resource reservation. Even though existing slack time schedulers perform well in a closed real-time system (with well-behaved applications,...
General purpose operating systems are hosting more and more time-sensitive applications such as mult...
In this paper, we explore the performance tradeoffs for real-time systems with Dynamic Voltage Scali...
Most real-time scheduling algorithms schedule tasks with regard to their worst case computation time...
This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guarante...
Resource sharing across different computers and organizations makes it possible to support diverse, ...
No on-line scheduling algorithm operating in a unipro-cessor environment can guarantee to obtain an ...
Real-time, fault-tolerant systems require schedulers that provide graceful degradation during transi...
This paper compares the performance of three classes of scheduling algorithms for real-time systems ...
Resource reclaiming refers to the problem of utilizing the resources left unused by a task when it e...
The scheduling of tasks in multiprocessor real-time systems has attracted many researchers in the re...
IRCCyN Technical Report(1) how to determine the slack at run time? (2) are there lower bounds to the...
The design of real-time systems is an activity that involves meticulous planning and management of m...
This report addresses the problem of jointly scheduling tasks with both hard and soft time constrai...
A dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers...
International audienceIn this paper, we present an extension of slack analysis for budgeting in the ...
General purpose operating systems are hosting more and more time-sensitive applications such as mult...
In this paper, we explore the performance tradeoffs for real-time systems with Dynamic Voltage Scali...
Most real-time scheduling algorithms schedule tasks with regard to their worst case computation time...
This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guarante...
Resource sharing across different computers and organizations makes it possible to support diverse, ...
No on-line scheduling algorithm operating in a unipro-cessor environment can guarantee to obtain an ...
Real-time, fault-tolerant systems require schedulers that provide graceful degradation during transi...
This paper compares the performance of three classes of scheduling algorithms for real-time systems ...
Resource reclaiming refers to the problem of utilizing the resources left unused by a task when it e...
The scheduling of tasks in multiprocessor real-time systems has attracted many researchers in the re...
IRCCyN Technical Report(1) how to determine the slack at run time? (2) are there lower bounds to the...
The design of real-time systems is an activity that involves meticulous planning and management of m...
This report addresses the problem of jointly scheduling tasks with both hard and soft time constrai...
A dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers...
International audienceIn this paper, we present an extension of slack analysis for budgeting in the ...
General purpose operating systems are hosting more and more time-sensitive applications such as mult...
In this paper, we explore the performance tradeoffs for real-time systems with Dynamic Voltage Scali...
Most real-time scheduling algorithms schedule tasks with regard to their worst case computation time...