In this paper we present an approach to schedulability analysis for hard real-time systems with control and data dependencies. We consider distributed architectures consisting of multiple programmable processors, and the scheduling policy is based on a static priority preemptive strategy. Our model of the system captures both data and control dependencies, and the schedulability approach is able to reduce the pessimism of the analysis by using the knowledge about control and data dependencies. Extensive experiments as well as a real life example demonstrate the efficiency of our approach. 1
In this paper, we address the problem of parametric schedu- lability analysis of distributed real-t...
Schedulability analysis of real-time systems under preemptive scheduling may often lead to false-neg...
Many real-time embedded systems involve a collection of independently executing event-driven code bl...
This paper focuses on the analysis of real-time non preemptive mul-tiprocessor scheduling with prece...
Abstract—Over the past decades several approaches for schedu-lability analysis have been proposed fo...
This paper considers the schedulability analysis of real-time distributed applications where tasks m...
For any real-time system, being predictable with respect to time is a basic necessity. The combinati...
To guarantee the timing requirements of real-time systems are satisfied, the timing behavior of the ...
Abstract In this paper, we study schedulability analysis problems for multi-processor real-time syst...
Scheduling theory as it applies to hard real-time environments with precedence and strict periodicit...
The hard deadline model is very popular in real-time research, but is representative or applicable t...
In this paper we study hard real-time systems composed of periodic preemptive tasks and address the ...
This paper addresses the schedulability problem of periodic and sporadic real-time task sets with co...
Abstract—Most safety critical embedded systems, i.e. systems for which constraints must necessarily ...
This paper presents a new schedulability analysis methodology for distributed hard real-time systems...
In this paper, we address the problem of parametric schedu- lability analysis of distributed real-t...
Schedulability analysis of real-time systems under preemptive scheduling may often lead to false-neg...
Many real-time embedded systems involve a collection of independently executing event-driven code bl...
This paper focuses on the analysis of real-time non preemptive mul-tiprocessor scheduling with prece...
Abstract—Over the past decades several approaches for schedu-lability analysis have been proposed fo...
This paper considers the schedulability analysis of real-time distributed applications where tasks m...
For any real-time system, being predictable with respect to time is a basic necessity. The combinati...
To guarantee the timing requirements of real-time systems are satisfied, the timing behavior of the ...
Abstract In this paper, we study schedulability analysis problems for multi-processor real-time syst...
Scheduling theory as it applies to hard real-time environments with precedence and strict periodicit...
The hard deadline model is very popular in real-time research, but is representative or applicable t...
In this paper we study hard real-time systems composed of periodic preemptive tasks and address the ...
This paper addresses the schedulability problem of periodic and sporadic real-time task sets with co...
Abstract—Most safety critical embedded systems, i.e. systems for which constraints must necessarily ...
This paper presents a new schedulability analysis methodology for distributed hard real-time systems...
In this paper, we address the problem of parametric schedu- lability analysis of distributed real-t...
Schedulability analysis of real-time systems under preemptive scheduling may often lead to false-neg...
Many real-time embedded systems involve a collection of independently executing event-driven code bl...