In this paper, the Behavioral Importance Priority Server (BIPS) algorithm is proposed to schedule sets of hard/soft real-time tasks. The mechanism postpones or advances the execution of the next instance of a task according to the value obtained from a function properly associated to the behavior of the task; as a consequence, there is a flexible adaptation of the bandwidth required by each server. A synchronization method is introduced to prevent deadlocks and priority inversions in the case of sets of tasks sharing resources along with the necessary and sufficient conditions for the schedulability analysis. A software framework proposing an abstract architecture of a system based on BIPS is also presented. The BIPS software framework inte...
This paper extends the useful concept of open sys-tems proposed by Liu, et al. [2, 3] in scheduling ...
The scheduling of tasks in a real-time system requires that, in addition to existing logical constra...
A scheduling technique is presented to minimize service delay of ape-riodic tasks in hard real-time ...
In this paper, the Behavioral Importance Priority Server (BIPS) algorithm is proposed to schedule se...
In this paper, we present a new strategy for providing flexibility in hard real-time systems. This a...
International audienceMany real-time systems must simultaneously handle hard real-time constraints a...
Abstract—Most real-time scheduling algorithms prioritize tasks solely based on their timing paramete...
The problem of real-time scheduling spans a broad spectrum of algorithms from simple uniprocessor to...
In this paper we study hard real-time systems composed of periodic preemptive tasks and address the ...
Many real-time systems must simultaneously handle hard realtime constraints and Quality of Service c...
International audienceIt is over 40 years since the first seminal work on priority assignment for re...
Abstract. In this paper we survey the most relevant results for the priority--based schedulability a...
In this paper we survey the most relevant results for the prioritybased schedulability analysis of r...
In this paper we study hard real-time systems: systems where strict time deadlines have to be met. ...
In recent years more and more real-time applications run on multiprocessor or distributed systems. I...
This paper extends the useful concept of open sys-tems proposed by Liu, et al. [2, 3] in scheduling ...
The scheduling of tasks in a real-time system requires that, in addition to existing logical constra...
A scheduling technique is presented to minimize service delay of ape-riodic tasks in hard real-time ...
In this paper, the Behavioral Importance Priority Server (BIPS) algorithm is proposed to schedule se...
In this paper, we present a new strategy for providing flexibility in hard real-time systems. This a...
International audienceMany real-time systems must simultaneously handle hard real-time constraints a...
Abstract—Most real-time scheduling algorithms prioritize tasks solely based on their timing paramete...
The problem of real-time scheduling spans a broad spectrum of algorithms from simple uniprocessor to...
In this paper we study hard real-time systems composed of periodic preemptive tasks and address the ...
Many real-time systems must simultaneously handle hard realtime constraints and Quality of Service c...
International audienceIt is over 40 years since the first seminal work on priority assignment for re...
Abstract. In this paper we survey the most relevant results for the priority--based schedulability a...
In this paper we survey the most relevant results for the prioritybased schedulability analysis of r...
In this paper we study hard real-time systems: systems where strict time deadlines have to be met. ...
In recent years more and more real-time applications run on multiprocessor or distributed systems. I...
This paper extends the useful concept of open sys-tems proposed by Liu, et al. [2, 3] in scheduling ...
The scheduling of tasks in a real-time system requires that, in addition to existing logical constra...
A scheduling technique is presented to minimize service delay of ape-riodic tasks in hard real-time ...