The aim of the research is to investigate techniques that support efficient service scheduling algorithms in a service-oriented fault-tolerant real-time distributed system. Techniques we developed include deadline- based real-time scheduling, priority-based scheduling, and redundant resource allocation for fault-tolerance. The system model and scheduling algorithms are designed, and a prototype is implemented to facilitate the investigation and experimentation
AbstractScheduling is a key component for performance guarantees in the case of distributed applicat...
International audienceHeterogeneous distributed systems are widely deployed for executing computatio...
Demands for reliability in distributed computing systems have become extremely important now a days ...
In distributed systems, a real-time task has several subtasks which need to be executed at different...
Safety critical real-time systems need to complement their methods for meeting timing constraints wi...
Real-time systems are being extensively used in applications that are mission-critical and life-crit...
This thesis deals with the problem of designing efficient fault-tolerant real-time scheduling algori...
We survey scheduling algorithms proposed for tolerating permanent and transient failures in real-tim...
The most important objective of real-time systems is to fulfill time-critical missions in satisfyin...
In this report I present some fault-tolerance techniques that has been implemented in a tool for rea...
7 pagesInternational audienceIn this paper, we propose an efficient scheduling algorithm for problem...
A monitoring approach to the problem of constructing fault-tolerant and adaptive real-time systems, ...
The design and analysis of real-time scheduling algorithms for safety-critical systems is a challeng...
Dependable real-time distributed systems rely on allocation and scheduling protocols to satisfy stri...
The complexity of modern real-time systems is increasing day by day. This inevitable rise in complex...
AbstractScheduling is a key component for performance guarantees in the case of distributed applicat...
International audienceHeterogeneous distributed systems are widely deployed for executing computatio...
Demands for reliability in distributed computing systems have become extremely important now a days ...
In distributed systems, a real-time task has several subtasks which need to be executed at different...
Safety critical real-time systems need to complement their methods for meeting timing constraints wi...
Real-time systems are being extensively used in applications that are mission-critical and life-crit...
This thesis deals with the problem of designing efficient fault-tolerant real-time scheduling algori...
We survey scheduling algorithms proposed for tolerating permanent and transient failures in real-tim...
The most important objective of real-time systems is to fulfill time-critical missions in satisfyin...
In this report I present some fault-tolerance techniques that has been implemented in a tool for rea...
7 pagesInternational audienceIn this paper, we propose an efficient scheduling algorithm for problem...
A monitoring approach to the problem of constructing fault-tolerant and adaptive real-time systems, ...
The design and analysis of real-time scheduling algorithms for safety-critical systems is a challeng...
Dependable real-time distributed systems rely on allocation and scheduling protocols to satisfy stri...
The complexity of modern real-time systems is increasing day by day. This inevitable rise in complex...
AbstractScheduling is a key component for performance guarantees in the case of distributed applicat...
International audienceHeterogeneous distributed systems are widely deployed for executing computatio...
Demands for reliability in distributed computing systems have become extremely important now a days ...