Distributed Real-Time Thread is an important concept for distributed real-time systems. Distributed Threads are schedulable entities with an end-to-end deadline that transpose nodes, carrying their scheduling context. In each node, the thread will be locally scheduled according to a local deadline, which is defined by a deadline partitioning algorithm. Mechanisms for predicting the missing of deadlines are fundamental if corrective actions are incorporated for improving system quality of service. In this work, a mechanism for predicting missing deadlines is proposed and evaluated through simulation. In order to illustrate the main characteristics of the proposed mechanism, experiments will be presented taking into account different scenario...
International audienceThis paper presents a connection between two real-time models: a deadline-base...
Complex distributed tasks often involve parallel execution of subtasks at different nodes. To meet t...
A set of four heuristic algorithms is presented to schedule tasks that have headlines and resource r...
Distributed real-time threads are schedulable entities with an end-to-end deadline that traverse nod...
In a distributed real-time system, an application usually consists of several component tasks and mu...
Many distributed and multiprocessor real-time applications consist of pipelines of tasks that must c...
In a distributed environment, tasks often have processing demands on multiple dierent sites. A distr...
This paper explores the probability of deadline misses for a set of constrained-deadline sporadic so...
International audienceThe current trend in modeling and analyzing real-time systems is toward tighte...
In distributed real-time systems, communicating processes cannot be delayed for arbitrary amounts of...
In a real-time system, tasks are constrained by global end-to-end deadlines. In order to cater for h...
Abstract Investigations into deadline guarantees in real-time systems have traditionally been domina...
Most works in schedulability analysis theory are based on the assumption that constraints on the per...
Most works in schedulability analysis theory are based on the assumption that constraints on the per...
International audienceThis paper presents a connection between two real-time models: a deadline-base...
Complex distributed tasks often involve parallel execution of subtasks at different nodes. To meet t...
A set of four heuristic algorithms is presented to schedule tasks that have headlines and resource r...
Distributed real-time threads are schedulable entities with an end-to-end deadline that traverse nod...
In a distributed real-time system, an application usually consists of several component tasks and mu...
Many distributed and multiprocessor real-time applications consist of pipelines of tasks that must c...
In a distributed environment, tasks often have processing demands on multiple dierent sites. A distr...
This paper explores the probability of deadline misses for a set of constrained-deadline sporadic so...
International audienceThe current trend in modeling and analyzing real-time systems is toward tighte...
In distributed real-time systems, communicating processes cannot be delayed for arbitrary amounts of...
In a real-time system, tasks are constrained by global end-to-end deadlines. In order to cater for h...
Abstract Investigations into deadline guarantees in real-time systems have traditionally been domina...
Most works in schedulability analysis theory are based on the assumption that constraints on the per...
Most works in schedulability analysis theory are based on the assumption that constraints on the per...
International audienceThis paper presents a connection between two real-time models: a deadline-base...
Complex distributed tasks often involve parallel execution of subtasks at different nodes. To meet t...
A set of four heuristic algorithms is presented to schedule tasks that have headlines and resource r...