This chapter deals with the problem of handling overload conditions, that is, those critical situations in which the computational demand requested by the application exceeds the processor capacity. If not properly handled, an overload can cause an abrupt performance degradation, or even a system crash. Therefore, a real-time system should be designed to anticipate and tolerate unexpected overload situations through specific kernel mechanisms
This paper presents Safe-ERfair, an efficient resource allocation strategy for handling overloads in...
We introduce a new design metric called system-resiliency which characterizes the maximum unpredicta...
Real-time systems have become increasingly important in a growing number of application domains such...
This chapter deals with the problem of handling overload conditions, that is, those critical situati...
No on-line scheduling algorithm operating in an uniprocessor environment can guarantee to obtain a u...
No on-line scheduling algorithm operating in an uniprocessor environment can guarantee to obtain a u...
For most computer systems, even short periods of overload degrade performance signi - cantly. The n...
In real-time systems, deadlines are imposed on the response time. Not meeting a deadline in a hard r...
International audienceThis paper discusses evaluation criteria and scheduling strategies for the ana...
This paper addresses overload control issues for distributed control systems, i.e. multiprocessor sy...
The master thesis deals with the techniques to prevent computer system from computational overloadin...
It has been proven that no on-line scheduling algorithm can guarantee a processor utilization greate...
Researchers have proposed approaches to verify that real-time multiprocessor systems meet their time...
Transient increase in computation load occurs in engineering applications. We present a novel appro...
In this paper we consider data freshness and overload handling in embedded systems. The requirements...
This paper presents Safe-ERfair, an efficient resource allocation strategy for handling overloads in...
We introduce a new design metric called system-resiliency which characterizes the maximum unpredicta...
Real-time systems have become increasingly important in a growing number of application domains such...
This chapter deals with the problem of handling overload conditions, that is, those critical situati...
No on-line scheduling algorithm operating in an uniprocessor environment can guarantee to obtain a u...
No on-line scheduling algorithm operating in an uniprocessor environment can guarantee to obtain a u...
For most computer systems, even short periods of overload degrade performance signi - cantly. The n...
In real-time systems, deadlines are imposed on the response time. Not meeting a deadline in a hard r...
International audienceThis paper discusses evaluation criteria and scheduling strategies for the ana...
This paper addresses overload control issues for distributed control systems, i.e. multiprocessor sy...
The master thesis deals with the techniques to prevent computer system from computational overloadin...
It has been proven that no on-line scheduling algorithm can guarantee a processor utilization greate...
Researchers have proposed approaches to verify that real-time multiprocessor systems meet their time...
Transient increase in computation load occurs in engineering applications. We present a novel appro...
In this paper we consider data freshness and overload handling in embedded systems. The requirements...
This paper presents Safe-ERfair, an efficient resource allocation strategy for handling overloads in...
We introduce a new design metric called system-resiliency which characterizes the maximum unpredicta...
Real-time systems have become increasingly important in a growing number of application domains such...
DOI
Add to ORKG